java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call4_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:06:22,052 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:06:22,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:06:22,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:06:22,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:06:22,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:06:22,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:06:22,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:06:22,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:06:22,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:06:22,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:06:22,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:06:22,076 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:06:22,077 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:06:22,078 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:06:22,079 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:06:22,080 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:06:22,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:06:22,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:06:22,085 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:06:22,086 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:06:22,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:06:22,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:06:22,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:06:22,091 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:06:22,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:06:22,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:06:22,093 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:06:22,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:06:22,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:06:22,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:06:22,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:06:22,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:06:22,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:06:22,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:06:22,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:06:22,099 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:06:22,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:06:22,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:06:22,115 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:06:22,115 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:06:22,115 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:06:22,116 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:06:22,116 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:06:22,116 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:06:22,116 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:06:22,116 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:06:22,117 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:06:22,117 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:06:22,117 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:06:22,118 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:06:22,118 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:06:22,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:06:22,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:06:22,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:06:22,118 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:06:22,119 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:06:22,120 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:06:22,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:06:22,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:06:22,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:06:22,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:06:22,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:06:22,121 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:06:22,121 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:06:22,121 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:06:22,121 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:06:22,122 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:06:22,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:06:22,123 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:06:22,123 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:06:22,123 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:06:22,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:06:22,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:06:22,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:06:22,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:06:22,202 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:06:22,203 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call4_true-termination.i [2018-11-07 22:06:22,260 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa682484c/4065b920c73648bfa8fe9ad48c017569/FLAGb3cf7b0ae [2018-11-07 22:06:22,724 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:06:22,725 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call4_true-termination.i [2018-11-07 22:06:22,730 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa682484c/4065b920c73648bfa8fe9ad48c017569/FLAGb3cf7b0ae [2018-11-07 22:06:22,744 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa682484c/4065b920c73648bfa8fe9ad48c017569 [2018-11-07 22:06:22,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:06:22,757 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:06:22,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:06:22,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:06:22,762 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:06:22,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:06:22" (1/1) ... [2018-11-07 22:06:22,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ade47ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:22, skipping insertion in model container [2018-11-07 22:06:22,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:06:22" (1/1) ... [2018-11-07 22:06:22,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:06:22,794 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:06:22,981 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:06:22,985 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:06:23,006 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:06:23,028 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:06:23,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23 WrapperNode [2018-11-07 22:06:23,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:06:23,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:06:23,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:06:23,030 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:06:23,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (1/1) ... [2018-11-07 22:06:23,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (1/1) ... [2018-11-07 22:06:23,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:06:23,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:06:23,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:06:23,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:06:23,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (1/1) ... [2018-11-07 22:06:23,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (1/1) ... [2018-11-07 22:06:23,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (1/1) ... [2018-11-07 22:06:23,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (1/1) ... [2018-11-07 22:06:23,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (1/1) ... [2018-11-07 22:06:23,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (1/1) ... [2018-11-07 22:06:23,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (1/1) ... [2018-11-07 22:06:23,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:06:23,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:06:23,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:06:23,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:06:23,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (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 [2018-11-07 22:06:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 22:06:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:06:23,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:06:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 22:06:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:06:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:06:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:06:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:06:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 22:06:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:06:23,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:06:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 22:06:23,585 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:06:23,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:06:23 BoogieIcfgContainer [2018-11-07 22:06:23,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:06:23,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:06:23,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:06:23,590 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:06:23,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:06:22" (1/3) ... [2018-11-07 22:06:23,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762be1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:06:23, skipping insertion in model container [2018-11-07 22:06:23,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:23" (2/3) ... [2018-11-07 22:06:23,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762be1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:06:23, skipping insertion in model container [2018-11-07 22:06:23,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:06:23" (3/3) ... [2018-11-07 22:06:23,593 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call4_true-termination.i [2018-11-07 22:06:23,603 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:06:23,610 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:06:23,628 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:06:23,663 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:06:23,663 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:06:23,663 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:06:23,664 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:06:23,664 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:06:23,664 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:06:23,664 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:06:23,664 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:06:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-07 22:06:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 22:06:23,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:23,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:23,693 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:23,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:23,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1537618980, now seen corresponding path program 1 times [2018-11-07 22:06:23,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:23,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:23,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:23,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:23,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:23,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:06:23,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:06:23,825 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:06:23,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:06:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:06:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:06:23,845 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-07 22:06:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:23,867 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-07 22:06:23,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:06:23,868 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-07 22:06:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:23,877 INFO L225 Difference]: With dead ends: 50 [2018-11-07 22:06:23,877 INFO L226 Difference]: Without dead ends: 23 [2018-11-07 22:06:23,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:06:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-07 22:06:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-07 22:06:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-07 22:06:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-07 22:06:23,920 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2018-11-07 22:06:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:23,920 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-07 22:06:23,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:06:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-07 22:06:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:06:23,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:23,922 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:23,922 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:23,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash -131902987, now seen corresponding path program 1 times [2018-11-07 22:06:23,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:23,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:23,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:23,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:23,925 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:23,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:06:23,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:06:23,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:06:23,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:06:23,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:06:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:06:23,996 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 3 states. [2018-11-07 22:06:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:24,084 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-07 22:06:24,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:06:24,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-07 22:06:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:24,087 INFO L225 Difference]: With dead ends: 44 [2018-11-07 22:06:24,087 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 22:06:24,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:06:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 22:06:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-07 22:06:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 22:06:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-07 22:06:24,095 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2018-11-07 22:06:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:24,096 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-07 22:06:24,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:06:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-07 22:06:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 22:06:24,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:24,097 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:24,097 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:24,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash 154158618, now seen corresponding path program 1 times [2018-11-07 22:06:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:24,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:24,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:24,100 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:24,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:24,210 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:24,211 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 22:06:24,213 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [17], [19], [23], [24], [28], [29], [32], [44], [47], [49], [55], [56], [57], [59] [2018-11-07 22:06:24,254 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:06:24,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:06:24,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:06:24,502 INFO L272 AbstractInterpreter]: Visited 22 different actions 52 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-07 22:06:24,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:24,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:06:24,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:24,514 INFO L194 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:24,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:24,534 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:24,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:24,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:24,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:24,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 22:06:24,781 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:24,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:06:24,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:06:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:06:24,783 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-11-07 22:06:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:25,027 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-07 22:06:25,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:06:25,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-07 22:06:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:25,032 INFO L225 Difference]: With dead ends: 54 [2018-11-07 22:06:25,032 INFO L226 Difference]: Without dead ends: 43 [2018-11-07 22:06:25,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:06:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-07 22:06:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-11-07 22:06:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 22:06:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-07 22:06:25,048 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-11-07 22:06:25,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:25,050 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-07 22:06:25,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:06:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-07 22:06:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 22:06:25,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:25,053 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:25,054 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:25,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1564418325, now seen corresponding path program 2 times [2018-11-07 22:06:25,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:25,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:25,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:25,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:25,056 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:25,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:25,210 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:25,210 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:25,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:25,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:25,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:25,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:25,227 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:25,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-07 22:06:25,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:25,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 22:06:25,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 22:06:25,434 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:06:25,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 11 [2018-11-07 22:06:25,434 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:06:25,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:06:25,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:06:25,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:06:25,436 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2018-11-07 22:06:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:25,618 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-07 22:06:25,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:06:25,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-07 22:06:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:25,620 INFO L225 Difference]: With dead ends: 39 [2018-11-07 22:06:25,620 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 22:06:25,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:06:25,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 22:06:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 22:06:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 22:06:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-07 22:06:25,627 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-11-07 22:06:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:25,627 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-07 22:06:25,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:06:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-07 22:06:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 22:06:25,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:25,629 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:25,629 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:25,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash -582131022, now seen corresponding path program 1 times [2018-11-07 22:06:25,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:25,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:25,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:06:25,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:25,706 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:25,706 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 22:06:25,706 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [17], [19], [23], [24], [28], [29], [32], [34], [36], [44], [47], [49], [55], [56], [57], [59] [2018-11-07 22:06:25,708 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:06:25,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:06:25,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:06:25,875 INFO L272 AbstractInterpreter]: Visited 24 different actions 117 times. Merged at 10 different actions 60 times. Widened at 2 different actions 4 times. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-07 22:06:25,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:25,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:06:25,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:25,890 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:25,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:25,899 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:25,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:06:25,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:06:26,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:26,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 22:06:26,047 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:26,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:06:26,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:06:26,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:06:26,048 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 6 states. [2018-11-07 22:06:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:26,244 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-07 22:06:26,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:06:26,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-07 22:06:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:26,247 INFO L225 Difference]: With dead ends: 66 [2018-11-07 22:06:26,248 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 22:06:26,248 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:06:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 22:06:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2018-11-07 22:06:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 22:06:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-07 22:06:26,262 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2018-11-07 22:06:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:26,262 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-07 22:06:26,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:06:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-07 22:06:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 22:06:26,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:26,267 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:26,268 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:26,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:26,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1196798487, now seen corresponding path program 2 times [2018-11-07 22:06:26,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:26,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:26,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:06:26,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:26,555 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:26,555 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:26,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:26,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:26,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:26,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:26,565 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:26,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 22:06:26,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:26,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 22:06:26,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 22:06:26,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:26,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-11-07 22:06:26,783 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:26,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:06:26,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:06:26,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:06:26,785 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2018-11-07 22:06:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:26,912 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-07 22:06:26,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:06:26,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-07 22:06:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:26,915 INFO L225 Difference]: With dead ends: 78 [2018-11-07 22:06:26,915 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 22:06:26,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:06:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 22:06:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-11-07 22:06:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 22:06:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-07 22:06:26,923 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 37 [2018-11-07 22:06:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:26,924 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-07 22:06:26,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:06:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-07 22:06:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 22:06:26,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:26,926 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:26,926 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:26,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:26,927 INFO L82 PathProgramCache]: Analyzing trace with hash 692438953, now seen corresponding path program 3 times [2018-11-07 22:06:26,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:26,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:26,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:06:27,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:27,034 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:27,034 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:27,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:27,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:27,034 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:27,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:06:27,044 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:06:27,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:06:27,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:27,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:06:27,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:06:27,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:27,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 22:06:27,414 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:27,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:06:27,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:06:27,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:06:27,415 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 8 states. [2018-11-07 22:06:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:27,675 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-11-07 22:06:27,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:06:27,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-07 22:06:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:27,676 INFO L225 Difference]: With dead ends: 95 [2018-11-07 22:06:27,676 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 22:06:27,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:06:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 22:06:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-11-07 22:06:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 22:06:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-07 22:06:27,686 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-11-07 22:06:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:27,686 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-07 22:06:27,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:06:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-07 22:06:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:06:27,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:27,688 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:27,688 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:27,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1898597710, now seen corresponding path program 4 times [2018-11-07 22:06:27,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:27,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:27,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:27,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:27,690 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:06:27,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:27,824 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:27,824 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:27,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:27,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:27,825 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:27,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:27,840 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:27,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:06:27,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:06:28,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:28,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 22:06:28,079 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:28,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:06:28,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:06:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:06:28,080 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 9 states. [2018-11-07 22:06:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:28,157 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-07 22:06:28,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:06:28,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-07 22:06:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:28,160 INFO L225 Difference]: With dead ends: 105 [2018-11-07 22:06:28,160 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 22:06:28,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:06:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 22:06:28,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-11-07 22:06:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-07 22:06:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-11-07 22:06:28,168 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2018-11-07 22:06:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:28,169 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-11-07 22:06:28,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:06:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-07 22:06:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 22:06:28,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:28,170 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:28,170 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:28,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2048882999, now seen corresponding path program 5 times [2018-11-07 22:06:28,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:28,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:28,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:28,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:28,172 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:06:28,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:28,757 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:28,757 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:28,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:28,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:28,757 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:28,766 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:28,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 22:06:28,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:28,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 22:06:28,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 22:06:29,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:29,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-11-07 22:06:29,032 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:29,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:06:29,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:06:29,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:06:29,034 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 12 states. [2018-11-07 22:06:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:29,218 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-11-07 22:06:29,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:06:29,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-11-07 22:06:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:29,220 INFO L225 Difference]: With dead ends: 117 [2018-11-07 22:06:29,220 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 22:06:29,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-11-07 22:06:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 22:06:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-11-07 22:06:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 22:06:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-11-07 22:06:29,229 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 64 [2018-11-07 22:06:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:29,229 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-11-07 22:06:29,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:06:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-07 22:06:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-07 22:06:29,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:29,231 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:29,231 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:29,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash -478550523, now seen corresponding path program 6 times [2018-11-07 22:06:29,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:29,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:29,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:29,373 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:06:29,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:29,374 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:29,374 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:29,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:29,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:29,374 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:29,385 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:06:29,385 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:06:29,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:06:29,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:29,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:06:29,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:06:29,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:29,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 22:06:29,645 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:29,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:06:29,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:06:29,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:06:29,646 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 11 states. [2018-11-07 22:06:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:29,743 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2018-11-07 22:06:29,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:06:29,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-11-07 22:06:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:29,745 INFO L225 Difference]: With dead ends: 134 [2018-11-07 22:06:29,745 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 22:06:29,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:06:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 22:06:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-11-07 22:06:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 22:06:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-11-07 22:06:29,753 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 81 [2018-11-07 22:06:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:29,754 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-11-07 22:06:29,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:06:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-11-07 22:06:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 22:06:29,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:29,756 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:29,757 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:29,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:29,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1666973376, now seen corresponding path program 7 times [2018-11-07 22:06:29,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:29,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:29,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:29,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:29,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:06:29,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:29,934 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:29,934 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:29,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:29,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:29,935 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:29,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:29,944 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:29,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:06:30,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:06:30,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:30,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 22:06:30,243 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:30,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:06:30,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:06:30,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:06:30,244 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 12 states. [2018-11-07 22:06:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:30,399 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-11-07 22:06:30,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:06:30,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2018-11-07 22:06:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:30,401 INFO L225 Difference]: With dead ends: 144 [2018-11-07 22:06:30,401 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 22:06:30,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:06:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 22:06:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2018-11-07 22:06:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 22:06:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-07 22:06:30,410 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 86 [2018-11-07 22:06:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:30,410 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-07 22:06:30,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:06:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-07 22:06:30,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 22:06:30,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:30,412 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:30,412 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:30,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2059357467, now seen corresponding path program 8 times [2018-11-07 22:06:30,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:30,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:30,414 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:06:30,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:30,824 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:30,824 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:30,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:30,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:30,825 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:30,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:30,833 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:30,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 22:06:30,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:30,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 22:06:30,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 22:06:31,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:31,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2018-11-07 22:06:31,219 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:31,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:06:31,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:06:31,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:06:31,220 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 15 states. [2018-11-07 22:06:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:31,542 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2018-11-07 22:06:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:06:31,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2018-11-07 22:06:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:31,544 INFO L225 Difference]: With dead ends: 156 [2018-11-07 22:06:31,544 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 22:06:31,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:06:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 22:06:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-11-07 22:06:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-07 22:06:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-11-07 22:06:31,553 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 91 [2018-11-07 22:06:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:31,553 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-11-07 22:06:31,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:06:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-11-07 22:06:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-07 22:06:31,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:31,554 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:31,555 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:31,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:31,555 INFO L82 PathProgramCache]: Analyzing trace with hash -988518089, now seen corresponding path program 9 times [2018-11-07 22:06:31,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:31,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:31,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:31,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:31,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:06:31,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:31,790 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:31,790 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:31,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:31,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:31,790 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:31,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:06:31,799 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:06:31,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:06:31,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:31,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:06:31,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:06:32,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:32,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 22:06:32,514 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:32,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:06:32,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:06:32,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:06:32,515 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 14 states. [2018-11-07 22:06:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:32,623 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2018-11-07 22:06:32,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:06:32,623 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 108 [2018-11-07 22:06:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:32,625 INFO L225 Difference]: With dead ends: 173 [2018-11-07 22:06:32,625 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 22:06:32,626 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:06:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 22:06:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2018-11-07 22:06:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 22:06:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-11-07 22:06:32,633 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 108 [2018-11-07 22:06:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:32,633 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-11-07 22:06:32,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:06:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-11-07 22:06:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 22:06:32,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:32,635 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:32,635 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:32,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:32,635 INFO L82 PathProgramCache]: Analyzing trace with hash 765337884, now seen corresponding path program 10 times [2018-11-07 22:06:32,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:32,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:32,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:06:33,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:33,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:33,504 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:33,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:33,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:33,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:33,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:33,513 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:33,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:06:33,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:06:33,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:33,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 22:06:33,999 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:33,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:06:34,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:06:34,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:06:34,001 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 15 states. [2018-11-07 22:06:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:34,133 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-11-07 22:06:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:06:34,133 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 113 [2018-11-07 22:06:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:34,135 INFO L225 Difference]: With dead ends: 183 [2018-11-07 22:06:34,135 INFO L226 Difference]: Without dead ends: 133 [2018-11-07 22:06:34,137 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:06:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-07 22:06:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-11-07 22:06:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-07 22:06:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-11-07 22:06:34,142 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 113 [2018-11-07 22:06:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:34,142 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-11-07 22:06:34,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:06:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-11-07 22:06:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 22:06:34,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:34,144 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:34,144 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:34,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:34,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2141941673, now seen corresponding path program 11 times [2018-11-07 22:06:34,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:34,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:34,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 22:06:34,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:34,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:34,323 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:34,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:34,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:34,323 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:34,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:34,331 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:34,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 22:06:34,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:34,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-07 22:06:34,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-07 22:06:34,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:34,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2018-11-07 22:06:34,923 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:34,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:06:34,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:06:34,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:06:34,924 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 18 states. [2018-11-07 22:06:35,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:35,100 INFO L93 Difference]: Finished difference Result 195 states and 200 transitions. [2018-11-07 22:06:35,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:06:35,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2018-11-07 22:06:35,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:35,101 INFO L225 Difference]: With dead ends: 195 [2018-11-07 22:06:35,102 INFO L226 Difference]: Without dead ends: 140 [2018-11-07 22:06:35,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2018-11-07 22:06:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-07 22:06:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2018-11-07 22:06:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-07 22:06:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-11-07 22:06:35,108 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 118 [2018-11-07 22:06:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:35,109 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-11-07 22:06:35,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:06:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-11-07 22:06:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 22:06:35,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:35,110 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:35,111 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:35,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash -619705133, now seen corresponding path program 12 times [2018-11-07 22:06:35,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:35,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:35,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:35,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:35,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:06:35,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:35,352 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:35,352 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:35,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:35,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:35,352 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:35,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:06:35,365 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:06:35,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:06:35,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:35,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:06:35,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:06:36,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:36,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 22:06:36,111 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:36,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:06:36,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:06:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:06:36,112 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 17 states. [2018-11-07 22:06:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:36,270 INFO L93 Difference]: Finished difference Result 212 states and 215 transitions. [2018-11-07 22:06:36,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:06:36,271 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 135 [2018-11-07 22:06:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:36,272 INFO L225 Difference]: With dead ends: 212 [2018-11-07 22:06:36,273 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 22:06:36,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:06:36,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 22:06:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2018-11-07 22:06:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 22:06:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-11-07 22:06:36,279 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 135 [2018-11-07 22:06:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:36,279 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-11-07 22:06:36,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:06:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-11-07 22:06:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 22:06:36,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:36,281 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:36,281 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:36,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1009225166, now seen corresponding path program 13 times [2018-11-07 22:06:36,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:36,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:36,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:36,283 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:06:37,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:37,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:37,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:37,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:37,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:37,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:37,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:37,317 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:37,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:06:37,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:06:37,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:37,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 22:06:37,870 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:37,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:06:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:06:37,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:06:37,871 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 18 states. [2018-11-07 22:06:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:38,020 INFO L93 Difference]: Finished difference Result 222 states and 226 transitions. [2018-11-07 22:06:38,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:06:38,020 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 140 [2018-11-07 22:06:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:38,022 INFO L225 Difference]: With dead ends: 222 [2018-11-07 22:06:38,022 INFO L226 Difference]: Without dead ends: 160 [2018-11-07 22:06:38,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:06:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-07 22:06:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2018-11-07 22:06:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-07 22:06:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-11-07 22:06:38,028 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 140 [2018-11-07 22:06:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:38,029 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-11-07 22:06:38,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:06:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-11-07 22:06:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 22:06:38,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:38,030 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:38,030 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:38,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:38,030 INFO L82 PathProgramCache]: Analyzing trace with hash 168849843, now seen corresponding path program 14 times [2018-11-07 22:06:38,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:38,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:38,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:38,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:38,032 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 22:06:38,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:38,411 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:38,411 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:38,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:38,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:38,411 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:38,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:38,419 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:38,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 22:06:38,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:38,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-07 22:06:38,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-07 22:06:39,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:39,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 37 [2018-11-07 22:06:39,464 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:39,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 22:06:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 22:06:39,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:06:39,466 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 21 states. [2018-11-07 22:06:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:39,712 INFO L93 Difference]: Finished difference Result 234 states and 239 transitions. [2018-11-07 22:06:39,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:06:39,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2018-11-07 22:06:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:39,714 INFO L225 Difference]: With dead ends: 234 [2018-11-07 22:06:39,714 INFO L226 Difference]: Without dead ends: 167 [2018-11-07 22:06:39,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:06:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-07 22:06:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2018-11-07 22:06:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-07 22:06:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-11-07 22:06:39,723 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 145 [2018-11-07 22:06:39,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:39,723 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-11-07 22:06:39,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 22:06:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-11-07 22:06:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-07 22:06:39,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:39,724 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:39,724 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:39,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash 914159813, now seen corresponding path program 15 times [2018-11-07 22:06:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:39,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:39,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:06:40,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:40,131 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:40,131 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:40,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:40,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:40,131 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:40,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:06:40,139 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:06:40,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:06:40,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:40,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:06:40,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:06:41,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:41,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 22:06:41,455 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:41,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:06:41,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:06:41,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:06:41,457 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 20 states. [2018-11-07 22:06:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:41,619 INFO L93 Difference]: Finished difference Result 251 states and 254 transitions. [2018-11-07 22:06:41,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:06:41,620 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 162 [2018-11-07 22:06:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:41,621 INFO L225 Difference]: With dead ends: 251 [2018-11-07 22:06:41,621 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 22:06:41,622 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:06:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 22:06:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2018-11-07 22:06:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-07 22:06:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-11-07 22:06:41,627 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 162 [2018-11-07 22:06:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:41,627 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-11-07 22:06:41,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:06:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-11-07 22:06:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 22:06:41,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:41,628 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:41,629 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:41,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:41,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2141696746, now seen corresponding path program 16 times [2018-11-07 22:06:41,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:41,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:41,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:41,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:41,630 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:06:41,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:41,980 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:41,980 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:41,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:41,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:41,981 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:41,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:41,992 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:42,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:06:42,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:06:42,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:42,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 22:06:42,989 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:42,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 22:06:42,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 22:06:42,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:06:42,990 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 21 states. [2018-11-07 22:06:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:43,178 INFO L93 Difference]: Finished difference Result 261 states and 265 transitions. [2018-11-07 22:06:43,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:06:43,178 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 167 [2018-11-07 22:06:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:43,179 INFO L225 Difference]: With dead ends: 261 [2018-11-07 22:06:43,180 INFO L226 Difference]: Without dead ends: 187 [2018-11-07 22:06:43,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:06:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-07 22:06:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 173. [2018-11-07 22:06:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-07 22:06:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-11-07 22:06:43,188 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 167 [2018-11-07 22:06:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:43,189 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-11-07 22:06:43,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 22:06:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-11-07 22:06:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 22:06:43,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:43,190 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:43,190 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:43,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:43,191 INFO L82 PathProgramCache]: Analyzing trace with hash 88377317, now seen corresponding path program 17 times [2018-11-07 22:06:43,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:43,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:43,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:43,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:43,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 22:06:43,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:43,687 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:43,688 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:43,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:43,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:43,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:43,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:43,698 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:44,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 22:06:44,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:44,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-07 22:06:44,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-07 22:06:44,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:44,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 43 [2018-11-07 22:06:44,746 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:44,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 22:06:44,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 22:06:44,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:06:44,747 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 24 states. [2018-11-07 22:06:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:45,033 INFO L93 Difference]: Finished difference Result 273 states and 278 transitions. [2018-11-07 22:06:45,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:06:45,033 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 172 [2018-11-07 22:06:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:45,035 INFO L225 Difference]: With dead ends: 273 [2018-11-07 22:06:45,035 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 22:06:45,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:06:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 22:06:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2018-11-07 22:06:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-07 22:06:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-11-07 22:06:45,042 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 172 [2018-11-07 22:06:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:45,042 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-11-07 22:06:45,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 22:06:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-11-07 22:06:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-07 22:06:45,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:45,044 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:45,044 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:45,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:45,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1525477793, now seen corresponding path program 18 times [2018-11-07 22:06:45,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:45,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:45,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:45,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:45,045 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:06:45,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:45,389 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:45,390 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:45,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:45,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:45,390 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:45,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:06:45,400 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:06:46,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:06:46,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:46,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:06:46,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:06:46,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:46,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 22:06:46,708 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:46,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:06:46,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:06:46,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:06:46,710 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 23 states. [2018-11-07 22:06:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:47,116 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2018-11-07 22:06:47,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:06:47,120 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 189 [2018-11-07 22:06:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:47,121 INFO L225 Difference]: With dead ends: 290 [2018-11-07 22:06:47,121 INFO L226 Difference]: Without dead ends: 204 [2018-11-07 22:06:47,122 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:06:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-07 22:06:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 195. [2018-11-07 22:06:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-07 22:06:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-11-07 22:06:47,126 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 189 [2018-11-07 22:06:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:47,127 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-11-07 22:06:47,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:06:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-11-07 22:06:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 22:06:47,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:47,129 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:47,129 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:47,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1427376220, now seen corresponding path program 19 times [2018-11-07 22:06:47,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:47,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:47,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:47,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:47,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:06:48,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:48,368 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:48,368 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:48,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:48,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:48,369 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:48,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:48,376 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:48,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:06:48,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:06:49,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:49,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 22:06:49,141 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:49,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 22:06:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 22:06:49,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:06:49,143 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 24 states. [2018-11-07 22:06:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:50,041 INFO L93 Difference]: Finished difference Result 300 states and 304 transitions. [2018-11-07 22:06:50,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:06:50,041 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 194 [2018-11-07 22:06:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:50,043 INFO L225 Difference]: With dead ends: 300 [2018-11-07 22:06:50,043 INFO L226 Difference]: Without dead ends: 214 [2018-11-07 22:06:50,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:06:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-07 22:06:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 200. [2018-11-07 22:06:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-07 22:06:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-11-07 22:06:50,050 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 194 [2018-11-07 22:06:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:50,051 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-11-07 22:06:50,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 22:06:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-11-07 22:06:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 22:06:50,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:50,052 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:50,052 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:50,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:50,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1694822017, now seen corresponding path program 20 times [2018-11-07 22:06:50,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:50,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:50,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:50,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 22:06:50,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:50,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:50,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:50,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:50,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:50,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:50,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:50,947 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:51,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 22:06:51,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:51,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-11-07 22:06:52,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-11-07 22:06:53,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:53,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 49 [2018-11-07 22:06:53,414 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:53,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:06:53,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:06:53,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:06:53,416 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 27 states. [2018-11-07 22:06:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:53,708 INFO L93 Difference]: Finished difference Result 312 states and 317 transitions. [2018-11-07 22:06:53,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 22:06:53,709 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 199 [2018-11-07 22:06:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:53,710 INFO L225 Difference]: With dead ends: 312 [2018-11-07 22:06:53,711 INFO L226 Difference]: Without dead ends: 221 [2018-11-07 22:06:53,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 22:06:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-07 22:06:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2018-11-07 22:06:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-07 22:06:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-11-07 22:06:53,719 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 199 [2018-11-07 22:06:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:53,720 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-11-07 22:06:53,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:06:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-11-07 22:06:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 22:06:53,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:53,721 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:53,722 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:53,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:53,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2134603347, now seen corresponding path program 21 times [2018-11-07 22:06:53,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:53,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:53,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:53,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:53,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:06:54,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:54,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:54,737 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:54,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:54,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:54,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:54,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:06:54,746 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:06:55,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:06:55,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:55,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:06:56,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:06:56,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:56,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 22:06:56,885 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:56,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 22:06:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 22:06:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:06:56,887 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 26 states. [2018-11-07 22:06:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:57,092 INFO L93 Difference]: Finished difference Result 329 states and 332 transitions. [2018-11-07 22:06:57,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 22:06:57,093 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 216 [2018-11-07 22:06:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:57,095 INFO L225 Difference]: With dead ends: 329 [2018-11-07 22:06:57,095 INFO L226 Difference]: Without dead ends: 231 [2018-11-07 22:06:57,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:06:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-07 22:06:57,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 222. [2018-11-07 22:06:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-07 22:06:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-11-07 22:06:57,102 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 216 [2018-11-07 22:06:57,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:57,102 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-11-07 22:06:57,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 22:06:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-11-07 22:06:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 22:06:57,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:57,104 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:57,104 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:57,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:57,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1141310136, now seen corresponding path program 22 times [2018-11-07 22:06:57,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:57,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:57,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:57,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:06:57,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:57,849 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:57,849 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:57,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:57,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:57,849 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:57,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:57,857 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:57,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:06:57,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:06:58,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:58,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 22:06:58,750 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:58,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:06:58,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:06:58,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 22:06:58,752 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 27 states. [2018-11-07 22:06:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:59,155 INFO L93 Difference]: Finished difference Result 339 states and 343 transitions. [2018-11-07 22:06:59,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 22:06:59,156 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 221 [2018-11-07 22:06:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:59,158 INFO L225 Difference]: With dead ends: 339 [2018-11-07 22:06:59,158 INFO L226 Difference]: Without dead ends: 241 [2018-11-07 22:06:59,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 22:06:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-07 22:06:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2018-11-07 22:06:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-07 22:06:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-11-07 22:06:59,165 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 221 [2018-11-07 22:06:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:59,165 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-11-07 22:06:59,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:06:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-11-07 22:06:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-07 22:06:59,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:59,167 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:59,167 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:59,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:59,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1491889523, now seen corresponding path program 23 times [2018-11-07 22:06:59,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:59,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:59,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:59,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:59,169 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 22:06:59,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:59,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:59,850 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:59,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:59,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:59,851 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:06:59,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:59,859 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:07:01,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-07 22:07:01,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:01,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-07 22:07:01,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-07 22:07:01,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:01,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 55 [2018-11-07 22:07:01,861 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:01,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:07:01,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:07:01,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:07:01,864 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 30 states. [2018-11-07 22:07:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:02,143 INFO L93 Difference]: Finished difference Result 351 states and 356 transitions. [2018-11-07 22:07:02,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:07:02,143 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 226 [2018-11-07 22:07:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:02,145 INFO L225 Difference]: With dead ends: 351 [2018-11-07 22:07:02,145 INFO L226 Difference]: Without dead ends: 248 [2018-11-07 22:07:02,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 22:07:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-07 22:07:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2018-11-07 22:07:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-07 22:07:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 245 transitions. [2018-11-07 22:07:02,152 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 245 transitions. Word has length 226 [2018-11-07 22:07:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:02,152 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 245 transitions. [2018-11-07 22:07:02,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:07:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2018-11-07 22:07:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-07 22:07:02,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:02,154 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:02,154 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:02,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:02,155 INFO L82 PathProgramCache]: Analyzing trace with hash 760255599, now seen corresponding path program 24 times [2018-11-07 22:07:02,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:02,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:02,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:02,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:02,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:07:02,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:02,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:02,996 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:02,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:02,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:02,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:03,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:07:03,004 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:07:04,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:07:04,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:04,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:07:04,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:07:07,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:07,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 22:07:07,162 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:07,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 22:07:07,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 22:07:07,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:07:07,164 INFO L87 Difference]: Start difference. First operand 244 states and 245 transitions. Second operand 29 states. [2018-11-07 22:07:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:07,400 INFO L93 Difference]: Finished difference Result 368 states and 371 transitions. [2018-11-07 22:07:07,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:07:07,401 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 243 [2018-11-07 22:07:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:07,402 INFO L225 Difference]: With dead ends: 368 [2018-11-07 22:07:07,402 INFO L226 Difference]: Without dead ends: 258 [2018-11-07 22:07:07,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:07:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-07 22:07:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2018-11-07 22:07:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-07 22:07:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-11-07 22:07:07,409 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 243 [2018-11-07 22:07:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:07,409 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-11-07 22:07:07,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 22:07:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-11-07 22:07:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-07 22:07:07,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:07,411 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:07,411 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:07,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:07,412 INFO L82 PathProgramCache]: Analyzing trace with hash 337998058, now seen corresponding path program 25 times [2018-11-07 22:07:07,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:07,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:07,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:07,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:07,413 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:07:08,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:08,009 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:08,009 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:08,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:08,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:08,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:08,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:08,019 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:07:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:08,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:07:08,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:07:09,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:09,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 22:07:09,309 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:09,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:07:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:07:09,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:07:09,311 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 30 states. [2018-11-07 22:07:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:09,566 INFO L93 Difference]: Finished difference Result 378 states and 382 transitions. [2018-11-07 22:07:09,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:07:09,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 248 [2018-11-07 22:07:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:09,570 INFO L225 Difference]: With dead ends: 378 [2018-11-07 22:07:09,570 INFO L226 Difference]: Without dead ends: 268 [2018-11-07 22:07:09,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:07:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-07 22:07:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 254. [2018-11-07 22:07:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-07 22:07:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 255 transitions. [2018-11-07 22:07:09,576 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 255 transitions. Word has length 248 [2018-11-07 22:07:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:09,577 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 255 transitions. [2018-11-07 22:07:09,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:07:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 255 transitions. [2018-11-07 22:07:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 22:07:09,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:09,579 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:09,579 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:09,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1914820273, now seen corresponding path program 26 times [2018-11-07 22:07:09,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:09,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:09,580 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 22:07:10,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:10,244 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:10,245 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:10,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:10,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:10,245 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:10,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:07:10,253 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:07:12,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 22:07:12,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:12,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-11-07 22:07:12,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-11-07 22:07:14,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:14,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 61 [2018-11-07 22:07:14,196 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:14,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:07:14,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:07:14,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:07:14,198 INFO L87 Difference]: Start difference. First operand 254 states and 255 transitions. Second operand 33 states. [2018-11-07 22:07:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:14,575 INFO L93 Difference]: Finished difference Result 390 states and 395 transitions. [2018-11-07 22:07:14,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:07:14,575 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 253 [2018-11-07 22:07:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:14,577 INFO L225 Difference]: With dead ends: 390 [2018-11-07 22:07:14,578 INFO L226 Difference]: Without dead ends: 275 [2018-11-07 22:07:14,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1612, Invalid=2170, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 22:07:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-07 22:07:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-11-07 22:07:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-07 22:07:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-11-07 22:07:14,585 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 253 [2018-11-07 22:07:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:14,586 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-11-07 22:07:14,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 22:07:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-11-07 22:07:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-07 22:07:14,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:14,587 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:14,588 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:14,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash 344711649, now seen corresponding path program 27 times [2018-11-07 22:07:14,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:14,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:14,589 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:07:15,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:15,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:15,083 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:15,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:15,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:15,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:15,091 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:07:15,091 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:07:17,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:07:17,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:17,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:07:17,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:07:19,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:19,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 22:07:19,119 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:19,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 22:07:19,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 22:07:19,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:07:19,120 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 32 states. [2018-11-07 22:07:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:19,397 INFO L93 Difference]: Finished difference Result 407 states and 410 transitions. [2018-11-07 22:07:19,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:07:19,398 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 270 [2018-11-07 22:07:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:19,399 INFO L225 Difference]: With dead ends: 407 [2018-11-07 22:07:19,399 INFO L226 Difference]: Without dead ends: 285 [2018-11-07 22:07:19,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:07:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-07 22:07:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 276. [2018-11-07 22:07:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-07 22:07:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 277 transitions. [2018-11-07 22:07:19,406 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 277 transitions. Word has length 270 [2018-11-07 22:07:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:19,406 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 277 transitions. [2018-11-07 22:07:19,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 22:07:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 277 transitions. [2018-11-07 22:07:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 22:07:19,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:19,408 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:19,409 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:19,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:19,409 INFO L82 PathProgramCache]: Analyzing trace with hash -537128826, now seen corresponding path program 28 times [2018-11-07 22:07:19,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:19,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:19,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:19,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:19,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:07:20,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:20,061 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:20,061 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:20,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:20,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:20,061 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:20,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:20,074 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:07:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:20,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:07:20,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:07:21,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:21,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 22:07:21,347 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:21,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:07:21,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:07:21,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 22:07:21,348 INFO L87 Difference]: Start difference. First operand 276 states and 277 transitions. Second operand 33 states. [2018-11-07 22:07:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:21,630 INFO L93 Difference]: Finished difference Result 417 states and 421 transitions. [2018-11-07 22:07:21,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:07:21,631 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 275 [2018-11-07 22:07:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:21,633 INFO L225 Difference]: With dead ends: 417 [2018-11-07 22:07:21,633 INFO L226 Difference]: Without dead ends: 295 [2018-11-07 22:07:21,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 22:07:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-07 22:07:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2018-11-07 22:07:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-07 22:07:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-11-07 22:07:21,640 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 275 [2018-11-07 22:07:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:21,640 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-11-07 22:07:21,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 22:07:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-11-07 22:07:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-07 22:07:21,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:21,642 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:21,642 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:21,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:21,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1393049857, now seen corresponding path program 29 times [2018-11-07 22:07:21,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:21,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:21,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:21,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:21,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 22:07:22,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:22,633 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:22,633 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:22,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:22,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:22,633 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:22,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:07:22,645 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:07:30,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-07 22:07:30,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:30,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-11-07 22:07:30,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-11-07 22:07:31,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:31,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 67 [2018-11-07 22:07:31,474 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:31,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 22:07:31,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 22:07:31,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=2459, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:07:31,476 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 36 states. [2018-11-07 22:07:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:31,798 INFO L93 Difference]: Finished difference Result 429 states and 434 transitions. [2018-11-07 22:07:31,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:07:31,798 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 280 [2018-11-07 22:07:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:31,800 INFO L225 Difference]: With dead ends: 429 [2018-11-07 22:07:31,800 INFO L226 Difference]: Without dead ends: 302 [2018-11-07 22:07:31,801 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1969, Invalid=2587, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 22:07:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-11-07 22:07:31,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2018-11-07 22:07:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-07 22:07:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2018-11-07 22:07:31,805 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 280 [2018-11-07 22:07:31,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:31,806 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2018-11-07 22:07:31,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 22:07:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2018-11-07 22:07:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-07 22:07:31,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:31,807 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:31,807 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:31,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:31,807 INFO L82 PathProgramCache]: Analyzing trace with hash -990186179, now seen corresponding path program 30 times [2018-11-07 22:07:31,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:31,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:31,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:31,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:31,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:07:32,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:32,445 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:32,445 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:32,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:32,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:32,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:32,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:07:32,454 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:07:37,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:07:37,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:37,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:07:37,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:07:39,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:39,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-07 22:07:39,090 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:39,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 22:07:39,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 22:07:39,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:07:39,091 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 35 states. [2018-11-07 22:07:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:39,417 INFO L93 Difference]: Finished difference Result 446 states and 449 transitions. [2018-11-07 22:07:39,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 22:07:39,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 297 [2018-11-07 22:07:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:39,420 INFO L225 Difference]: With dead ends: 446 [2018-11-07 22:07:39,420 INFO L226 Difference]: Without dead ends: 312 [2018-11-07 22:07:39,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:07:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-07 22:07:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 303. [2018-11-07 22:07:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-07 22:07:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-11-07 22:07:39,427 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 297 [2018-11-07 22:07:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:39,428 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-11-07 22:07:39,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 22:07:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-11-07 22:07:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-07 22:07:39,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:39,430 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:39,430 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:39,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash 429377400, now seen corresponding path program 31 times [2018-11-07 22:07:39,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:39,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:39,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:07:40,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:40,409 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:40,409 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:40,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:40,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:40,409 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:40,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:40,417 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:07:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:40,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:07:40,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:07:41,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:41,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-07 22:07:41,918 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:41,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 22:07:41,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 22:07:41,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:07:41,920 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 36 states. [2018-11-07 22:07:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:42,236 INFO L93 Difference]: Finished difference Result 456 states and 460 transitions. [2018-11-07 22:07:42,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:07:42,236 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 302 [2018-11-07 22:07:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:42,238 INFO L225 Difference]: With dead ends: 456 [2018-11-07 22:07:42,238 INFO L226 Difference]: Without dead ends: 322 [2018-11-07 22:07:42,239 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:07:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-07 22:07:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 308. [2018-11-07 22:07:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-07 22:07:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 309 transitions. [2018-11-07 22:07:42,245 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 309 transitions. Word has length 302 [2018-11-07 22:07:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:42,245 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 309 transitions. [2018-11-07 22:07:42,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 22:07:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 309 transitions. [2018-11-07 22:07:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-07 22:07:42,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:42,247 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:42,248 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:42,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash 81535517, now seen corresponding path program 32 times [2018-11-07 22:07:42,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:42,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:42,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:42,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:42,249 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 22:07:42,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:42,916 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:42,916 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:42,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:42,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:42,917 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:42,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:07:42,925 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:07:51,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 22:07:51,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:51,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-11-07 22:07:52,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-11-07 22:07:53,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:53,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 73 [2018-11-07 22:07:53,348 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:53,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:07:53,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:07:53,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2356, Invalid=2900, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:07:53,349 INFO L87 Difference]: Start difference. First operand 308 states and 309 transitions. Second operand 39 states. [2018-11-07 22:07:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:53,709 INFO L93 Difference]: Finished difference Result 468 states and 473 transitions. [2018-11-07 22:07:53,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 22:07:53,710 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 307 [2018-11-07 22:07:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:53,712 INFO L225 Difference]: With dead ends: 468 [2018-11-07 22:07:53,712 INFO L226 Difference]: Without dead ends: 329 [2018-11-07 22:07:53,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2362, Invalid=3040, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:07:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-07 22:07:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2018-11-07 22:07:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-07 22:07:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-11-07 22:07:53,719 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 307 [2018-11-07 22:07:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:53,720 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-11-07 22:07:53,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:07:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-11-07 22:07:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-07 22:07:53,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:53,722 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:53,722 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:53,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1087751313, now seen corresponding path program 33 times [2018-11-07 22:07:53,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:53,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:53,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:53,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:53,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:07:54,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:54,708 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:54,708 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:54,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:54,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:54,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:54,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:07:54,717 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:08:01,291 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:08:01,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:08:01,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:08:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:08:01,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:08:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:08:03,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:08:03,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-07 22:08:03,478 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:08:03,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:08:03,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:08:03,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:08:03,480 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 38 states. [2018-11-07 22:08:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:08:03,856 INFO L93 Difference]: Finished difference Result 485 states and 488 transitions. [2018-11-07 22:08:03,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 22:08:03,856 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 324 [2018-11-07 22:08:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:08:03,858 INFO L225 Difference]: With dead ends: 485 [2018-11-07 22:08:03,858 INFO L226 Difference]: Without dead ends: 339 [2018-11-07 22:08:03,859 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:08:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-07 22:08:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 330. [2018-11-07 22:08:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-11-07 22:08:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2018-11-07 22:08:03,865 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 324 [2018-11-07 22:08:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:08:03,865 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2018-11-07 22:08:03,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:08:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2018-11-07 22:08:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-07 22:08:03,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:08:03,867 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:08:03,867 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:08:03,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:08:03,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1632033876, now seen corresponding path program 34 times [2018-11-07 22:08:03,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:08:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:03,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:08:03,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:03,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:08:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:08:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:08:04,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:04,977 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:08:04,977 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:08:04,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:08:04,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:04,977 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:08:04,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:08:04,985 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:08:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:08:05,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:08:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:08:05,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:08:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:08:06,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:08:06,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-07 22:08:06,578 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:08:06,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:08:06,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:08:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 22:08:06,580 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 39 states. [2018-11-07 22:08:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:08:07,048 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2018-11-07 22:08:07,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 22:08:07,049 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 329 [2018-11-07 22:08:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:08:07,051 INFO L225 Difference]: With dead ends: 495 [2018-11-07 22:08:07,051 INFO L226 Difference]: Without dead ends: 349 [2018-11-07 22:08:07,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 22:08:07,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-07 22:08:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-11-07 22:08:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-07 22:08:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-11-07 22:08:07,058 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 329 [2018-11-07 22:08:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:08:07,058 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-11-07 22:08:07,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:08:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-11-07 22:08:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-07 22:08:07,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:08:07,061 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:08:07,061 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:08:07,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:08:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1054081679, now seen corresponding path program 35 times [2018-11-07 22:08:07,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:08:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:07,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:08:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:07,062 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:08:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:08:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 22:08:07,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:07,814 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:08:07,814 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:08:07,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:08:07,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:07,814 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:08:07,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:08:07,822 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:08:25,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-07 22:08:25,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:08:25,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:08:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-11-07 22:08:25,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:08:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-11-07 22:08:27,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:08:27,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 79 [2018-11-07 22:08:27,073 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:08:27,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:08:27,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:08:27,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2785, Invalid=3377, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:08:27,074 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 42 states. [2018-11-07 22:08:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:08:29,308 INFO L93 Difference]: Finished difference Result 507 states and 512 transitions. [2018-11-07 22:08:29,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:08:29,309 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 334 [2018-11-07 22:08:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:08:29,311 INFO L225 Difference]: With dead ends: 507 [2018-11-07 22:08:29,311 INFO L226 Difference]: Without dead ends: 356 [2018-11-07 22:08:29,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2791, Invalid=3529, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 22:08:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-07 22:08:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2018-11-07 22:08:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-07 22:08:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 353 transitions. [2018-11-07 22:08:29,319 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 353 transitions. Word has length 334 [2018-11-07 22:08:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:08:29,319 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 353 transitions. [2018-11-07 22:08:29,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:08:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 353 transitions. [2018-11-07 22:08:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-11-07 22:08:29,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:08:29,321 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:08:29,322 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:08:29,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:08:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1563169803, now seen corresponding path program 36 times [2018-11-07 22:08:29,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:08:29,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:29,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:08:29,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:29,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:08:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:08:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:08:30,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:30,511 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:08:30,511 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:08:30,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:08:30,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:30,511 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:08:30,521 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:08:30,521 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:08:39,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:08:39,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:08:39,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:08:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:08:39,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:08:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:08:41,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:08:41,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-07 22:08:41,763 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:08:41,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 22:08:41,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 22:08:41,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:08:41,765 INFO L87 Difference]: Start difference. First operand 352 states and 353 transitions. Second operand 41 states. [2018-11-07 22:08:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:08:42,188 INFO L93 Difference]: Finished difference Result 524 states and 527 transitions. [2018-11-07 22:08:42,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 22:08:42,188 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 351 [2018-11-07 22:08:42,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:08:42,189 INFO L225 Difference]: With dead ends: 524 [2018-11-07 22:08:42,189 INFO L226 Difference]: Without dead ends: 366 [2018-11-07 22:08:42,190 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:08:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-07 22:08:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 357. [2018-11-07 22:08:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-11-07 22:08:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-11-07 22:08:42,197 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 351 [2018-11-07 22:08:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:08:42,197 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-11-07 22:08:42,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 22:08:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-11-07 22:08:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-07 22:08:42,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:08:42,199 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:08:42,200 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:08:42,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:08:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1495731206, now seen corresponding path program 37 times [2018-11-07 22:08:42,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:08:42,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:42,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:08:42,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:42,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:08:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:08:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:08:43,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:43,081 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:08:43,081 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:08:43,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:08:43,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:43,081 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:08:43,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:08:43,090 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:08:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:08:43,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:08:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:08:43,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:08:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:08:44,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:08:44,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-07 22:08:44,906 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:08:44,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:08:44,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:08:44,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 22:08:44,907 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 42 states. [2018-11-07 22:08:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:08:45,357 INFO L93 Difference]: Finished difference Result 534 states and 538 transitions. [2018-11-07 22:08:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:08:45,357 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 356 [2018-11-07 22:08:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:08:45,359 INFO L225 Difference]: With dead ends: 534 [2018-11-07 22:08:45,359 INFO L226 Difference]: Without dead ends: 376 [2018-11-07 22:08:45,360 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 22:08:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-11-07 22:08:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 362. [2018-11-07 22:08:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-11-07 22:08:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 363 transitions. [2018-11-07 22:08:45,366 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 363 transitions. Word has length 356 [2018-11-07 22:08:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:08:45,366 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 363 transitions. [2018-11-07 22:08:45,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:08:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 363 transitions. [2018-11-07 22:08:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-11-07 22:08:45,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:08:45,369 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:08:45,369 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:08:45,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:08:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash -222373653, now seen corresponding path program 38 times [2018-11-07 22:08:45,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:08:45,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:45,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:08:45,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:45,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:08:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:08:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 22:08:46,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:46,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:08:46,358 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:08:46,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:08:46,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:46,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:08:46,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:08:46,366 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:09:12,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 22:09:12,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:09:12,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:09:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-11-07 22:09:12,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:09:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-11-07 22:09:14,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:09:14,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 85 [2018-11-07 22:09:14,539 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:09:14,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:09:14,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:09:14,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=3890, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:09:14,540 INFO L87 Difference]: Start difference. First operand 362 states and 363 transitions. Second operand 45 states. [2018-11-07 22:09:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:09:14,926 INFO L93 Difference]: Finished difference Result 546 states and 551 transitions. [2018-11-07 22:09:14,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:09:14,927 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 361 [2018-11-07 22:09:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:09:14,929 INFO L225 Difference]: With dead ends: 546 [2018-11-07 22:09:14,929 INFO L226 Difference]: Without dead ends: 383 [2018-11-07 22:09:14,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3256, Invalid=4054, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 22:09:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-11-07 22:09:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2018-11-07 22:09:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 22:09:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-11-07 22:09:14,936 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 361 [2018-11-07 22:09:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:09:14,936 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-11-07 22:09:14,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:09:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-11-07 22:09:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-11-07 22:09:14,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:09:14,939 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:09:14,939 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:09:14,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:09:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2069005053, now seen corresponding path program 39 times [2018-11-07 22:09:14,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:09:14,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:09:14,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:09:14,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:09:14,941 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:09:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:09:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:09:15,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:09:15,895 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:09:15,895 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:09:15,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:09:15,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:09:15,895 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:09:15,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:09:15,903 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:09:28,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:09:28,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:09:28,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:09:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:09:28,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:09:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:09:29,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:09:29,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-07 22:09:29,997 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:09:29,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 22:09:29,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 22:09:29,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:09:29,999 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 44 states. [2018-11-07 22:09:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:09:30,468 INFO L93 Difference]: Finished difference Result 563 states and 566 transitions. [2018-11-07 22:09:30,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 22:09:30,468 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 378 [2018-11-07 22:09:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:09:30,471 INFO L225 Difference]: With dead ends: 563 [2018-11-07 22:09:30,471 INFO L226 Difference]: Without dead ends: 393 [2018-11-07 22:09:30,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:09:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-11-07 22:09:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 384. [2018-11-07 22:09:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-11-07 22:09:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2018-11-07 22:09:30,478 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 378 [2018-11-07 22:09:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:09:30,478 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2018-11-07 22:09:30,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 22:09:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2018-11-07 22:09:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-07 22:09:30,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:09:30,480 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:09:30,480 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:09:30,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:09:30,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1641585118, now seen corresponding path program 40 times [2018-11-07 22:09:30,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:09:30,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:09:30,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:09:30,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:09:30,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:09:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:09:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:09:31,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:09:31,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:09:31,830 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:09:31,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:09:31,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:09:31,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:09:31,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:09:31,838 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:09:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:09:31,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:09:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:09:32,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:09:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:09:34,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:09:34,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-07 22:09:34,047 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:09:34,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:09:34,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:09:34,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 22:09:34,048 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 45 states. [2018-11-07 22:09:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:09:34,526 INFO L93 Difference]: Finished difference Result 573 states and 577 transitions. [2018-11-07 22:09:34,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:09:34,526 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 383 [2018-11-07 22:09:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:09:34,527 INFO L225 Difference]: With dead ends: 573 [2018-11-07 22:09:34,528 INFO L226 Difference]: Without dead ends: 403 [2018-11-07 22:09:34,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 22:09:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-11-07 22:09:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 389. [2018-11-07 22:09:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-07 22:09:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-11-07 22:09:34,535 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 383 [2018-11-07 22:09:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:09:34,535 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-11-07 22:09:34,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:09:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-11-07 22:09:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-11-07 22:09:34,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:09:34,538 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:09:34,538 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:09:34,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:09:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1156861411, now seen corresponding path program 41 times [2018-11-07 22:09:34,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:09:34,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:09:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:09:34,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:09:34,539 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:09:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:09:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:09:35,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:09:35,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:09:35,378 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:09:35,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:09:35,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:09:35,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:09:35,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:09:35,388 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:10:12,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-07 22:10:12,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:12,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-11-07 22:10:13,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-11-07 22:10:15,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:15,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 91 [2018-11-07 22:10:15,150 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:15,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:10:15,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:10:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4439, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 22:10:15,152 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 48 states. [2018-11-07 22:10:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:15,559 INFO L93 Difference]: Finished difference Result 585 states and 590 transitions. [2018-11-07 22:10:15,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:10:15,560 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 388 [2018-11-07 22:10:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:15,562 INFO L225 Difference]: With dead ends: 585 [2018-11-07 22:10:15,562 INFO L226 Difference]: Without dead ends: 410 [2018-11-07 22:10:15,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3757, Invalid=4615, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 22:10:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-07 22:10:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 406. [2018-11-07 22:10:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-11-07 22:10:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 407 transitions. [2018-11-07 22:10:15,569 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 407 transitions. Word has length 388 [2018-11-07 22:10:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:15,570 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 407 transitions. [2018-11-07 22:10:15,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:10:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 407 transitions. [2018-11-07 22:10:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-11-07 22:10:15,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:15,573 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:15,573 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:15,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:15,573 INFO L82 PathProgramCache]: Analyzing trace with hash 430174425, now seen corresponding path program 42 times [2018-11-07 22:10:15,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:15,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:15,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:15,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:15,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:10:17,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:17,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:17,273 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:17,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:17,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:17,274 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:17,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:10:17,282 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:10:29,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:10:29,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:29,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:10:29,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:10:31,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:31,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-07 22:10:31,690 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:31,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 22:10:31,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 22:10:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 22:10:31,692 INFO L87 Difference]: Start difference. First operand 406 states and 407 transitions. Second operand 47 states. [2018-11-07 22:10:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:32,354 INFO L93 Difference]: Finished difference Result 602 states and 605 transitions. [2018-11-07 22:10:32,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 22:10:32,355 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 405 [2018-11-07 22:10:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:32,357 INFO L225 Difference]: With dead ends: 602 [2018-11-07 22:10:32,357 INFO L226 Difference]: Without dead ends: 420 [2018-11-07 22:10:32,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 22:10:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-11-07 22:10:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 411. [2018-11-07 22:10:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-11-07 22:10:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-11-07 22:10:32,365 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 405 [2018-11-07 22:10:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:32,365 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-11-07 22:10:32,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 22:10:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-11-07 22:10:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-11-07 22:10:32,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:32,368 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:32,369 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:32,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:32,369 INFO L82 PathProgramCache]: Analyzing trace with hash -99664236, now seen corresponding path program 43 times [2018-11-07 22:10:32,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:32,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:32,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:32,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:32,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:10:33,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:33,597 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:33,597 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:33,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:33,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:33,597 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:33,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:33,606 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:33,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:10:33,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 22:10:36,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:36,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-11-07 22:10:36,022 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:36,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:10:36,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:10:36,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 22:10:36,024 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 48 states. [2018-11-07 22:10:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:36,706 INFO L93 Difference]: Finished difference Result 612 states and 616 transitions. [2018-11-07 22:10:36,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:10:36,707 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 410 [2018-11-07 22:10:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:36,710 INFO L225 Difference]: With dead ends: 612 [2018-11-07 22:10:36,710 INFO L226 Difference]: Without dead ends: 430 [2018-11-07 22:10:36,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 775 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 22:10:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-07 22:10:36,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 416. [2018-11-07 22:10:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-11-07 22:10:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 417 transitions. [2018-11-07 22:10:36,718 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 417 transitions. Word has length 410 [2018-11-07 22:10:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:36,718 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 417 transitions. [2018-11-07 22:10:36,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:10:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 417 transitions. [2018-11-07 22:10:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-11-07 22:10:36,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:36,721 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:36,721 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:36,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1220955577, now seen corresponding path program 44 times [2018-11-07 22:10:36,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:36,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:36,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-07 22:10:37,372 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:10:37,377 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:10:37,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:10:37 BoogieIcfgContainer [2018-11-07 22:10:37,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:10:37,378 INFO L168 Benchmark]: Toolchain (without parser) took 254622.20 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 996.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -844.5 MB). Peak memory consumption was 151.7 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:37,380 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:10:37,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:37,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:10:37,381 INFO L168 Benchmark]: Boogie Preprocessor took 22.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:10:37,381 INFO L168 Benchmark]: RCFGBuilder took 510.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.5 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:37,382 INFO L168 Benchmark]: TraceAbstraction took 253790.48 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 246.9 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -72.5 MB). Peak memory consumption was 174.4 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:37,385 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 271.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 510.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.5 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253790.48 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 246.9 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -72.5 MB). Peak memory consumption was 174.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was analyzing trace of length 416 with TraceHistMax 46,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. TIMEOUT Result, 253.7s OverallTime, 48 OverallIterations, 46 TraceHistogramMax, 16.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 891 SDtfs, 7988 SDslu, 11696 SDs, 0 SdLazy, 6551 SolverSat, 1694 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20210 GetRequests, 18045 SyntacticMatches, 0 SemanticMatches, 2165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6217 ImplicationChecksByTransitivity, 69.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=416occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 47 MinimizatonAttempts, 414 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 156.4s SatisfiabilityAnalysisTime, 75.7s InterpolantComputationTime, 19141 NumberOfCodeBlocks, 18991 NumberOfCodeBlocksAsserted, 393 NumberOfCheckSat, 28558 ConstructedInterpolants, 0 QuantifiedInterpolants, 15912466 SizeOfPredicates, 60 NumberOfNonLiveVariables, 15847 ConjunctsInSsa, 1127 ConjunctsInUnsatCore, 137 InterpolantComputations, 4 PerfectInterpolantSequences, 180858/386595 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown