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.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:33:48,958 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:33:48,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:33:48,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:33:48,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:33:48,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:33:48,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:33:48,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:33:48,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:33:48,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:33:48,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:33:48,981 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:33:48,982 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:33:48,983 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:33:48,984 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:33:48,985 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:33:48,986 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:33:48,989 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:33:48,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:33:48,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:33:49,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:33:49,004 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:33:49,009 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:33:49,009 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:33:49,009 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:33:49,010 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:33:49,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:33:49,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:33:49,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:33:49,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:33:49,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:33:49,019 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:33:49,020 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:33:49,020 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:33:49,021 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:33:49,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:33:49,022 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.epf [2018-11-07 16:33:49,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:33:49,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:33:49,056 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:33:49,056 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:33:49,056 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:33:49,056 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:33:49,057 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:33:49,057 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:33:49,057 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:33:49,057 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:33:49,057 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:33:49,058 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:33:49,059 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:33:49,059 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:33:49,059 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:33:49,059 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:33:49,059 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:33:49,060 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:33:49,060 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:33:49,060 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:33:49,060 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:33:49,060 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:33:49,061 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:33:49,061 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:33:49,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:33:49,061 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:33:49,061 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:33:49,062 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:33:49,062 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:33:49,062 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:33:49,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:33:49,062 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:33:49,063 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:33:49,063 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:33:49,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:33:49,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:33:49,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:33:49,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:33:49,140 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:33:49,141 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-07 16:33:49,206 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d84018a6/4325470d99984eb59665af2c40d89416/FLAGdb0f48664 [2018-11-07 16:33:49,639 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:33:49,640 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-07 16:33:49,647 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d84018a6/4325470d99984eb59665af2c40d89416/FLAGdb0f48664 [2018-11-07 16:33:49,664 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d84018a6/4325470d99984eb59665af2c40d89416 [2018-11-07 16:33:49,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:33:49,677 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:33:49,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:33:49,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:33:49,682 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:33:49,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:33:49" (1/1) ... [2018-11-07 16:33:49,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab1c4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:49, skipping insertion in model container [2018-11-07 16:33:49,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:33:49" (1/1) ... [2018-11-07 16:33:49,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:33:49,723 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:33:49,944 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:33:49,955 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:33:49,987 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:33:50,017 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:33:50,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50 WrapperNode [2018-11-07 16:33:50,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:33:50,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:33:50,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:33:50,020 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:33:50,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (1/1) ... [2018-11-07 16:33:50,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (1/1) ... [2018-11-07 16:33:50,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:33:50,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:33:50,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:33:50,045 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:33:50,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (1/1) ... [2018-11-07 16:33:50,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (1/1) ... [2018-11-07 16:33:50,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (1/1) ... [2018-11-07 16:33:50,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (1/1) ... [2018-11-07 16:33:50,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (1/1) ... [2018-11-07 16:33:50,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (1/1) ... [2018-11-07 16:33:50,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (1/1) ... [2018-11-07 16:33:50,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:33:50,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:33:50,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:33:50,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:33:50,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (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 16:33:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 16:33:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:33:50,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:33:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 16:33:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:33:50,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:33:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-11-07 16:33:50,214 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-11-07 16:33:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:33:50,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:33:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 16:33:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-07 16:33:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:33:50,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:33:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 16:33:50,744 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:33:50,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:33:50 BoogieIcfgContainer [2018-11-07 16:33:50,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:33:50,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:33:50,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:33:50,749 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:33:50,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:33:49" (1/3) ... [2018-11-07 16:33:50,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324ab9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:33:50, skipping insertion in model container [2018-11-07 16:33:50,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:50" (2/3) ... [2018-11-07 16:33:50,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324ab9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:33:50, skipping insertion in model container [2018-11-07 16:33:50,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:33:50" (3/3) ... [2018-11-07 16:33:50,753 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-11-07 16:33:50,763 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:33:50,771 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:33:50,788 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:33:50,825 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:33:50,826 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:33:50,826 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:33:50,826 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:33:50,826 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:33:50,827 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:33:50,827 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:33:50,827 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:33:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-07 16:33:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 16:33:50,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:50,858 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:50,860 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:50,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1074107771, now seen corresponding path program 1 times [2018-11-07 16:33:50,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:50,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:50,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:50,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:50,921 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:51,054 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 16:33:51,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:33:51,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:33:51,058 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:51,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:33:51,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:33:51,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:33:51,086 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-07 16:33:51,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:51,117 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-11-07 16:33:51,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:33:51,119 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-07 16:33:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:51,127 INFO L225 Difference]: With dead ends: 94 [2018-11-07 16:33:51,128 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 16:33:51,132 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 16:33:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 16:33:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-07 16:33:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 16:33:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 16:33:51,180 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 28 [2018-11-07 16:33:51,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:51,181 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 16:33:51,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:33:51,181 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 16:33:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 16:33:51,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:51,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:51,186 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:51,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:51,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2084935887, now seen corresponding path program 1 times [2018-11-07 16:33:51,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:51,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:51,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:51,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:51,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:51,321 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 16:33:51,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:33:51,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:33:51,323 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:51,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:33:51,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:33:51,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:33:51,327 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2018-11-07 16:33:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:51,529 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-11-07 16:33:51,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:33:51,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-07 16:33:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:51,532 INFO L225 Difference]: With dead ends: 86 [2018-11-07 16:33:51,532 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 16:33:51,533 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 16:33:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 16:33:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-07 16:33:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 16:33:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-07 16:33:51,547 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 30 [2018-11-07 16:33:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:51,548 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-07 16:33:51,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:33:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-07 16:33:51,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 16:33:51,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:51,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:51,553 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:51,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash -537387848, now seen corresponding path program 1 times [2018-11-07 16:33:51,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:51,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:51,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:51,685 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 16:33:51,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:51,686 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:51,687 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-07 16:33:51,689 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [94], [97], [99], [105], [106], [107], [109], [110], [111] [2018-11-07 16:33:51,726 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:33:51,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:33:51,971 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 16:33:51,972 INFO L272 AbstractInterpreter]: Visited 23 different actions 48 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-11-07 16:33:51,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:51,995 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 16:33:52,087 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 72.77% of their original sizes. [2018-11-07 16:33:52,087 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 16:33:52,402 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-11-07 16:33:52,402 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 16:33:52,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:33:52,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2018-11-07 16:33:52,404 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:52,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:33:52,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:33:52,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:33:52,405 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-11-07 16:33:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:53,305 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-07 16:33:53,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:33:53,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-07 16:33:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:53,309 INFO L225 Difference]: With dead ends: 88 [2018-11-07 16:33:53,309 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 16:33:53,310 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:33:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 16:33:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2018-11-07 16:33:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 16:33:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 16:33:53,324 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 34 [2018-11-07 16:33:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:53,324 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 16:33:53,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:33:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 16:33:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 16:33:53,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:53,327 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:53,327 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:53,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:53,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1292749679, now seen corresponding path program 1 times [2018-11-07 16:33:53,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:53,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:53,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:53,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:53,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:33:53,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:53,431 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:53,432 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-07 16:33:53,432 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [21], [25], [28], [43], [44], [45], [46], [47], [48], [50], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [94], [97], [99], [105], [106], [107], [109], [110], [111] [2018-11-07 16:33:53,435 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:33:53,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:33:53,489 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 16:33:53,490 INFO L272 AbstractInterpreter]: Visited 26 different actions 51 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-11-07 16:33:53,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:53,535 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 16:33:53,595 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 57.75% of their original sizes. [2018-11-07 16:33:53,595 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 16:33:53,732 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-11-07 16:33:53,733 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 16:33:53,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:33:53,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-07 16:33:53,733 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:53,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:33:53,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:33:53,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:33:53,735 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 10 states. [2018-11-07 16:33:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:54,900 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-07 16:33:54,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:33:54,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-07 16:33:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:54,902 INFO L225 Difference]: With dead ends: 109 [2018-11-07 16:33:54,902 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 16:33:54,903 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:33:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 16:33:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2018-11-07 16:33:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 16:33:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-07 16:33:54,913 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 45 [2018-11-07 16:33:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:54,913 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-07 16:33:54,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:33:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-07 16:33:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 16:33:54,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:54,915 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:54,915 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:54,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash -735946969, now seen corresponding path program 1 times [2018-11-07 16:33:54,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:54,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:54,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:54,918 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:33:55,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:55,026 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:55,026 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-07 16:33:55,027 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [21], [25], [28], [30], [31], [32], [35], [39], [43], [44], [45], [46], [47], [48], [50], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [94], [97], [99], [105], [106], [107], [109], [110], [111] [2018-11-07 16:33:55,033 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:33:55,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:33:55,149 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:33:55,149 INFO L272 AbstractInterpreter]: Visited 48 different actions 137 times. Merged at 20 different actions 75 times. Widened at 3 different actions 3 times. Found 5 fixpoints after 4 different actions. Largest state had 26 variables. [2018-11-07 16:33:55,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:55,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:33:55,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:55,182 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 16:33:55,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:55,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:33:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:55,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:33:55,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:33:55,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 16:33:55,399 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:55,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:33:55,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:33:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:33:55,400 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2018-11-07 16:33:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:55,474 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-07 16:33:55,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:33:55,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-07 16:33:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:55,476 INFO L225 Difference]: With dead ends: 98 [2018-11-07 16:33:55,476 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 16:33:55,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:33:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 16:33:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-07 16:33:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 16:33:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-07 16:33:55,486 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 51 [2018-11-07 16:33:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:55,486 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-07 16:33:55,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:33:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-07 16:33:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 16:33:55,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:55,489 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:55,489 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:55,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:55,490 INFO L82 PathProgramCache]: Analyzing trace with hash -310563840, now seen corresponding path program 2 times [2018-11-07 16:33:55,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:55,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:55,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:55,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:55,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:33:55,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:55,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:55,578 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:33:55,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:33:55,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:55,579 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 16:33:55,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:33:55,590 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:33:55,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:33:55,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:33:55,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 16:33:55,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 16:33:56,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:56,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2018-11-07 16:33:56,125 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:56,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:33:56,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:33:56,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:33:56,127 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 8 states. [2018-11-07 16:33:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:56,364 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-07 16:33:56,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:33:56,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-07 16:33:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:56,367 INFO L225 Difference]: With dead ends: 130 [2018-11-07 16:33:56,367 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 16:33:56,368 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:33:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 16:33:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2018-11-07 16:33:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 16:33:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-11-07 16:33:56,379 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 55 [2018-11-07 16:33:56,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:56,379 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-11-07 16:33:56,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:33:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-11-07 16:33:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-07 16:33:56,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:56,381 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:56,382 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:56,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:56,382 INFO L82 PathProgramCache]: Analyzing trace with hash -893647280, now seen corresponding path program 3 times [2018-11-07 16:33:56,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:56,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:56,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:33:56,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:56,384 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 16:33:56,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:56,763 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:56,763 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:33:56,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:33:56,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:56,763 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 16:33:56,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:33:56,782 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:33:56,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:33:56,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:33:56,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 16:33:56,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 16:33:57,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:57,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2018-11-07 16:33:57,053 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:57,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:33:57,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:33:57,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:33:57,055 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 6 states. [2018-11-07 16:33:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:57,105 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2018-11-07 16:33:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:33:57,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-07 16:33:57,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:57,107 INFO L225 Difference]: With dead ends: 136 [2018-11-07 16:33:57,107 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 16:33:57,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:33:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 16:33:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-07 16:33:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-07 16:33:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-11-07 16:33:57,120 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 70 [2018-11-07 16:33:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:57,120 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-11-07 16:33:57,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:33:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-11-07 16:33:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 16:33:57,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:57,122 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:57,123 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:57,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:57,123 INFO L82 PathProgramCache]: Analyzing trace with hash -858298153, now seen corresponding path program 4 times [2018-11-07 16:33:57,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:57,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:57,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:33:57,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:57,125 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 16:33:57,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:57,360 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:57,360 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:33:57,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:33:57,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:57,360 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 16:33:57,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:57,370 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:33:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:57,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 16:33:57,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 16:33:57,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:57,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-11-07 16:33:57,636 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:57,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:33:57,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:33:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:33:57,637 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 7 states. [2018-11-07 16:33:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:57,807 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2018-11-07 16:33:57,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:33:57,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-07 16:33:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:57,810 INFO L225 Difference]: With dead ends: 162 [2018-11-07 16:33:57,810 INFO L226 Difference]: Without dead ends: 111 [2018-11-07 16:33:57,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:33:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-07 16:33:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2018-11-07 16:33:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 16:33:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-11-07 16:33:57,823 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 74 [2018-11-07 16:33:57,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:57,824 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-11-07 16:33:57,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:33:57,824 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-07 16:33:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-07 16:33:57,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:57,826 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:57,826 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:57,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:57,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1243598882, now seen corresponding path program 5 times [2018-11-07 16:33:57,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:57,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:57,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:57,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:57,828 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 16:33:57,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:57,978 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:57,978 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:33:57,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:33:57,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:57,978 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 16:33:57,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:33:57,987 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:33:58,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:33:58,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:33:58,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 16:33:58,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 16:33:58,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:58,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2018-11-07 16:33:58,406 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:58,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:33:58,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:33:58,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:33:58,408 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 11 states. [2018-11-07 16:33:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:58,687 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2018-11-07 16:33:58,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:33:58,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-11-07 16:33:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:58,690 INFO L225 Difference]: With dead ends: 164 [2018-11-07 16:33:58,690 INFO L226 Difference]: Without dead ends: 125 [2018-11-07 16:33:58,691 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:33:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-07 16:33:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2018-11-07 16:33:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 16:33:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-11-07 16:33:58,703 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 78 [2018-11-07 16:33:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:58,704 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-11-07 16:33:58,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:33:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-11-07 16:33:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 16:33:58,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:58,707 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:58,707 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:58,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:58,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1357170623, now seen corresponding path program 6 times [2018-11-07 16:33:58,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:58,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:58,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:33:58,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:58,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-07 16:33:58,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:33:58,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:33:58,982 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:58,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:33:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:33:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:33:58,983 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 5 states. [2018-11-07 16:33:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:59,096 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-11-07 16:33:59,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:33:59,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-11-07 16:33:59,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:59,099 INFO L225 Difference]: With dead ends: 170 [2018-11-07 16:33:59,099 INFO L226 Difference]: Without dead ends: 131 [2018-11-07 16:33:59,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:33:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-07 16:33:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2018-11-07 16:33:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-07 16:33:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-11-07 16:33:59,112 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 95 [2018-11-07 16:33:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:59,113 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-11-07 16:33:59,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:33:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-11-07 16:33:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 16:33:59,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:59,115 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:59,115 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:59,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:59,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2060814037, now seen corresponding path program 7 times [2018-11-07 16:33:59,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:59,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:59,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:33:59,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:59,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-07 16:33:59,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:59,922 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:59,922 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:33:59,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:33:59,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:59,922 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 16:33:59,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:59,956 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:34:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:00,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 16:34:00,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 16:34:00,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:00,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 18 [2018-11-07 16:34:00,424 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:00,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:34:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:34:00,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:34:00,426 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 13 states. [2018-11-07 16:34:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:01,080 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2018-11-07 16:34:01,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:34:01,081 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 101 [2018-11-07 16:34:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:01,082 INFO L225 Difference]: With dead ends: 198 [2018-11-07 16:34:01,082 INFO L226 Difference]: Without dead ends: 131 [2018-11-07 16:34:01,084 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:34:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-07 16:34:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-11-07 16:34:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-07 16:34:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2018-11-07 16:34:01,094 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 101 [2018-11-07 16:34:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:01,095 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2018-11-07 16:34:01,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:34:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2018-11-07 16:34:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 16:34:01,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:01,096 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:01,097 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:01,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:01,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2079477055, now seen corresponding path program 8 times [2018-11-07 16:34:01,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:01,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:01,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:01,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:01,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 46 proven. 44 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-07 16:34:01,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:01,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:01,293 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:01,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:01,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:01,293 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 16:34:01,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:34:01,302 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:34:01,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:34:01,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:01,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 16:34:01,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 16:34:02,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:02,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2018-11-07 16:34:02,287 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:02,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:34:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:34:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:34:02,289 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 14 states. [2018-11-07 16:34:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:03,570 INFO L93 Difference]: Finished difference Result 316 states and 362 transitions. [2018-11-07 16:34:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 16:34:03,570 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-07 16:34:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:03,573 INFO L225 Difference]: With dead ends: 316 [2018-11-07 16:34:03,573 INFO L226 Difference]: Without dead ends: 266 [2018-11-07 16:34:03,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=756, Invalid=1896, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:34:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-07 16:34:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 187. [2018-11-07 16:34:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-07 16:34:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2018-11-07 16:34:03,590 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 107 [2018-11-07 16:34:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:03,590 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2018-11-07 16:34:03,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:34:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2018-11-07 16:34:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 16:34:03,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:03,592 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:03,592 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:03,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:03,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1662210968, now seen corresponding path program 9 times [2018-11-07 16:34:03,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:03,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:03,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:34:03,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:03,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-11-07 16:34:03,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:03,681 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:03,681 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:03,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:03,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:03,682 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 16:34:03,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:34:03,690 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:34:03,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:34:03,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:03,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 132 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-07 16:34:03,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 132 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-07 16:34:04,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:04,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 17 [2018-11-07 16:34:04,156 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:04,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:34:04,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:34:04,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:34:04,157 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand 11 states. [2018-11-07 16:34:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:04,440 INFO L93 Difference]: Finished difference Result 324 states and 362 transitions. [2018-11-07 16:34:04,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:34:04,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2018-11-07 16:34:04,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:04,443 INFO L225 Difference]: With dead ends: 324 [2018-11-07 16:34:04,444 INFO L226 Difference]: Without dead ends: 197 [2018-11-07 16:34:04,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:34:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-07 16:34:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2018-11-07 16:34:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-07 16:34:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-11-07 16:34:04,458 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 142 [2018-11-07 16:34:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:04,459 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-11-07 16:34:04,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:34:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-11-07 16:34:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 16:34:04,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:04,461 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:04,461 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:04,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:04,462 INFO L82 PathProgramCache]: Analyzing trace with hash -800280201, now seen corresponding path program 10 times [2018-11-07 16:34:04,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:04,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:04,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:34:04,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:04,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 307 proven. 30 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-11-07 16:34:04,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:04,619 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:04,619 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:04,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:04,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:04,619 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 16:34:04,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:04,630 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:34:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:04,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 212 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:34:04,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 212 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:34:05,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:05,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2018-11-07 16:34:05,116 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:05,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:34:05,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:34:05,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:34:05,117 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 15 states. [2018-11-07 16:34:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:05,826 INFO L93 Difference]: Finished difference Result 326 states and 363 transitions. [2018-11-07 16:34:05,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:34:05,826 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 159 [2018-11-07 16:34:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:05,829 INFO L225 Difference]: With dead ends: 326 [2018-11-07 16:34:05,829 INFO L226 Difference]: Without dead ends: 222 [2018-11-07 16:34:05,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 316 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=1130, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:34:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-07 16:34:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 210. [2018-11-07 16:34:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 16:34:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 230 transitions. [2018-11-07 16:34:05,845 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 230 transitions. Word has length 159 [2018-11-07 16:34:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:05,846 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 230 transitions. [2018-11-07 16:34:05,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:34:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 230 transitions. [2018-11-07 16:34:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-07 16:34:05,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:05,848 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:05,848 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:05,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1318567839, now seen corresponding path program 11 times [2018-11-07 16:34:05,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:05,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:05,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-11-07 16:34:06,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:06,525 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:06,525 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:06,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:06,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:06,525 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 16:34:06,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:34:06,536 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:34:06,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 16:34:06,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:06,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:07,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-11-07 16:34:07,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:07,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:07,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-11-07 16:34:07,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:07,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:07,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:07,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:42 [2018-11-07 16:34:07,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-07 16:34:07,438 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:07,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:07,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-07 16:34:07,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:07,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:07,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:34:07,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2018-11-07 16:34:08,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-07 16:34:08,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:08,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:08,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 111 [2018-11-07 16:34:08,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2018-11-07 16:34:08,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 16:34:08,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-07 16:34:08,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:126 [2018-11-07 16:34:08,561 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-07 16:34:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 274 proven. 47 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-07 16:34:09,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:11,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-11-07 16:34:11,723 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:34:11,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:11,726 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:34:11,726 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:11,742 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:11,744 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,745 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,746 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,746 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,747 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 109 [2018-11-07 16:34:11,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:11,758 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,758 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:11,760 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,760 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,761 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,761 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,765 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,766 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,766 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:11,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 154 [2018-11-07 16:34:11,772 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:11,787 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:34:11,787 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:11,794 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:34:11,794 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:11,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:11,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:11,846 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:103, output treesize:40 [2018-11-07 16:34:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 252 proven. 69 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-07 16:34:12,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:12,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27, 26] total 65 [2018-11-07 16:34:12,067 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:12,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 16:34:12,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 16:34:12,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=3763, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 16:34:12,073 INFO L87 Difference]: Start difference. First operand 210 states and 230 transitions. Second operand 41 states. [2018-11-07 16:34:14,046 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2018-11-07 16:34:14,329 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2018-11-07 16:34:14,866 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-11-07 16:34:15,070 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-11-07 16:34:15,275 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-11-07 16:34:17,723 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-11-07 16:34:18,873 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2018-11-07 16:34:20,067 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-07 16:34:20,965 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2018-11-07 16:34:21,554 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2018-11-07 16:34:21,983 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-11-07 16:34:22,559 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2018-11-07 16:34:22,767 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2018-11-07 16:34:23,326 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-11-07 16:34:23,521 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-11-07 16:34:23,779 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-11-07 16:34:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:28,656 INFO L93 Difference]: Finished difference Result 1081 states and 1210 transitions. [2018-11-07 16:34:28,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-11-07 16:34:28,657 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 165 [2018-11-07 16:34:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:28,663 INFO L225 Difference]: With dead ends: 1081 [2018-11-07 16:34:28,664 INFO L226 Difference]: Without dead ends: 1029 [2018-11-07 16:34:28,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8348 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=3472, Invalid=25258, Unknown=0, NotChecked=0, Total=28730 [2018-11-07 16:34:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-11-07 16:34:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 540. [2018-11-07 16:34:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-11-07 16:34:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 621 transitions. [2018-11-07 16:34:28,735 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 621 transitions. Word has length 165 [2018-11-07 16:34:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:28,736 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 621 transitions. [2018-11-07 16:34:28,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 16:34:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 621 transitions. [2018-11-07 16:34:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-07 16:34:28,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:28,739 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:28,739 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:28,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:28,740 INFO L82 PathProgramCache]: Analyzing trace with hash 500946348, now seen corresponding path program 1 times [2018-11-07 16:34:28,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:28,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:28,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:34:28,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:28,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 1 proven. 284 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-07 16:34:29,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:29,784 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:29,784 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-07 16:34:29,785 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [21], [25], [28], [30], [31], [32], [35], [37], [39], [43], [44], [45], [46], [47], [48], [50], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [85], [87], [94], [97], [99], [102], [104], [105], [106], [107], [109], [110], [111], [112] [2018-11-07 16:34:29,787 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:34:29,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:34:29,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:34:29,927 INFO L272 AbstractInterpreter]: Visited 54 different actions 220 times. Merged at 29 different actions 115 times. Widened at 4 different actions 5 times. Found 14 fixpoints after 8 different actions. Largest state had 26 variables. [2018-11-07 16:34:29,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:29,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:34:29,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:29,947 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 16:34:29,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:29,955 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:34:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:30,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:30,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 59 [2018-11-07 16:34:30,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:30,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:30,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:30,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:30,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:30,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:30,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 140 [2018-11-07 16:34:30,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:30,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:30,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:30,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:49 [2018-11-07 16:34:31,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-11-07 16:34:31,012 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 140 [2018-11-07 16:34:31,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:31,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:31,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:31,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:53 [2018-11-07 16:34:31,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-11-07 16:34:31,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:31,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-07 16:34:31,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:31,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:31,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:31,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:9 [2018-11-07 16:34:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 191 proven. 215 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-07 16:34:31,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:34,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 80 [2018-11-07 16:34:35,005 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,006 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,006 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,012 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,013 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,014 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,018 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,021 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,034 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,035 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,036 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,043 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 80 treesize of output 262 [2018-11-07 16:34:35,103 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-07 16:34:35,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 27 xjuncts. [2018-11-07 16:34:35,229 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,246 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,366 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,380 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,460 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,488 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,631 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,640 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,653 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,756 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:35,756 INFO L303 Elim1Store]: Index analysis took 570 ms [2018-11-07 16:34:36,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 265 [2018-11-07 16:34:36,335 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-07 16:34:36,519 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 36 xjuncts. [2018-11-07 16:34:36,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:36,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,567 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,580 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,593 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,630 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,682 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,759 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,759 INFO L303 Elim1Store]: Index analysis took 238 ms [2018-11-07 16:34:36,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 169 [2018-11-07 16:34:36,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:36,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:36,889 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,903 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,915 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,928 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,937 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,951 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:36,977 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,000 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,038 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,051 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,064 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,103 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,164 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,198 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,199 INFO L303 Elim1Store]: Index analysis took 356 ms [2018-11-07 16:34:37,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 241 [2018-11-07 16:34:37,352 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-07 16:34:37,402 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,418 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,473 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,473 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,475 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,483 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,494 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,495 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,495 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,502 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,503 INFO L303 Elim1Store]: Index analysis took 149 ms [2018-11-07 16:34:37,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 88 treesize of output 269 [2018-11-07 16:34:37,568 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-07 16:34:37,915 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 30 xjuncts. [2018-11-07 16:34:37,932 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,932 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,934 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,942 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,944 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,944 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,954 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,960 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,975 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,977 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,977 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:37,986 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 83 treesize of output 266 [2018-11-07 16:34:38,042 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-07 16:34:38,191 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 23 xjuncts. [2018-11-07 16:34:38,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,233 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,241 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,256 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,265 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,279 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,287 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:38,308 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,311 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,312 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,318 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,319 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,320 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:38,321 INFO L303 Elim1Store]: Index analysis took 128 ms [2018-11-07 16:34:38,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 154 [2018-11-07 16:34:38,323 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:39,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:34:39,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:34:39,022 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:94, output treesize:83 [2018-11-07 16:34:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 350 proven. 56 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-07 16:34:39,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:39,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 21] total 63 [2018-11-07 16:34:39,349 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:39,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 16:34:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 16:34:39,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3651, Unknown=1, NotChecked=0, Total=3906 [2018-11-07 16:34:39,351 INFO L87 Difference]: Start difference. First operand 540 states and 621 transitions. Second operand 44 states. [2018-11-07 16:34:43,860 WARN L179 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-11-07 16:34:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:46,501 INFO L93 Difference]: Finished difference Result 907 states and 1048 transitions. [2018-11-07 16:34:46,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 16:34:46,501 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 175 [2018-11-07 16:34:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:46,506 INFO L225 Difference]: With dead ends: 907 [2018-11-07 16:34:46,506 INFO L226 Difference]: Without dead ends: 632 [2018-11-07 16:34:46,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 322 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=775, Invalid=9730, Unknown=1, NotChecked=0, Total=10506 [2018-11-07 16:34:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-11-07 16:34:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 580. [2018-11-07 16:34:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-07 16:34:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 666 transitions. [2018-11-07 16:34:46,571 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 666 transitions. Word has length 175 [2018-11-07 16:34:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:46,571 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 666 transitions. [2018-11-07 16:34:46,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 16:34:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 666 transitions. [2018-11-07 16:34:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 16:34:46,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:46,575 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:46,575 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:46,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1646190659, now seen corresponding path program 2 times [2018-11-07 16:34:46,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:46,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:46,576 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 43 proven. 355 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-07 16:34:48,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:48,390 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:48,390 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:48,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 16:34:48,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:48,391 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 16:34:48,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:34:48,400 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:34:48,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 16:34:48,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:48,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:48,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-07 16:34:48,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-07 16:34:48,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-07 16:34:48,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-07 16:34:48,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-07 16:34:48,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-07 16:34:48,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-07 16:34:48,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-07 16:34:48,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-07 16:34:48,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,717 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-07 16:34:48,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-11-07 16:34:48,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-11-07 16:34:48,867 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,868 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,870 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,871 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-11-07 16:34:48,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:48,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-07 16:34:48,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-07 16:34:48,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:48,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 116 [2018-11-07 16:34:48,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-07 16:34:49,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:49,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:49,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-07 16:34:49,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:54 [2018-11-07 16:34:49,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-11-07 16:34:49,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-07 16:34:49,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:34:49,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:65 [2018-11-07 16:34:49,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-07 16:34:49,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 16:34:49,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 16:34:49,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-07 16:34:49,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-07 16:34:49,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 16:34:49,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 16:34:49,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-07 16:34:49,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-07 16:34:49,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 16:34:49,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 16:34:49,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-07 16:34:49,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-07 16:34:49,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 16:34:49,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:49,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-07 16:34:49,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:76 [2018-11-07 16:34:55,883 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-07 16:34:55,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-11-07 16:34:55,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:55,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:55,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:55,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:55,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:55,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:55,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:56,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:56,001 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:56,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:56,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 76 [2018-11-07 16:34:56,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:56,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2018-11-07 16:34:56,031 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:56,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:56,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:56,041 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:10 [2018-11-07 16:34:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 38 proven. 79 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-11-07 16:34:56,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:35:12,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 95 [2018-11-07 16:35:12,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2018-11-07 16:35:12,822 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 80 [2018-11-07 16:35:12,826 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,826 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,826 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 89 [2018-11-07 16:35:12,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:12,842 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:12,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:12,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-11-07 16:35:12,891 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,892 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,893 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:12,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 106 [2018-11-07 16:35:13,288 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 91 [2018-11-07 16:35:13,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,293 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,293 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,294 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2018-11-07 16:35:13,295 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:13,430 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,431 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,431 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-11-07 16:35:13,436 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:13,444 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,445 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,445 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,446 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-07 16:35:13,447 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:13,557 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,557 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:35:13,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,560 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-11-07 16:35:13,562 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:13,646 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,648 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,648 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-11-07 16:35:13,653 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:13,655 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,656 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,656 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:35:13,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 63 [2018-11-07 16:35:13,670 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-07 16:35:13,741 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 16:35:13,779 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:35:13,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:35:13,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:13,871 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:132, output treesize:6 [2018-11-07 16:35:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 67 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-07 16:35:22,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:35:22,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19, 17] total 63 [2018-11-07 16:35:22,073 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:35:22,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 16:35:22,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 16:35:22,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=3566, Unknown=10, NotChecked=0, Total=3906 [2018-11-07 16:35:22,075 INFO L87 Difference]: Start difference. First operand 580 states and 666 transitions. Second operand 48 states. [2018-11-07 16:35:50,786 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 51 [2018-11-07 16:35:52,907 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 53 [2018-11-07 16:35:57,030 WARN L179 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-11-07 16:36:01,173 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-07 16:36:05,307 WARN L179 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-11-07 16:36:09,568 WARN L179 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2018-11-07 16:36:13,860 WARN L179 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2018-11-07 16:36:18,051 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 108 DAG size of output: 67 [2018-11-07 16:36:22,255 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2018-11-07 16:36:26,435 WARN L179 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-11-07 16:36:42,956 WARN L179 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2018-11-07 16:36:57,409 WARN L179 SmtUtils]: Spent 6.24 s on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2018-11-07 16:37:46,232 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2018-11-07 16:38:06,455 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 Received shutdown request... [2018-11-07 16:38:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 16:38:18,525 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:38:18,530 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:38:18,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:38:18 BoogieIcfgContainer [2018-11-07 16:38:18,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:38:18,531 INFO L168 Benchmark]: Toolchain (without parser) took 268855.00 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -192.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 16:38:18,532 INFO L168 Benchmark]: CDTParser took 0.21 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 16:38:18,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.66 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 16:38:18,532 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.13 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 16:38:18,535 INFO L168 Benchmark]: Boogie Preprocessor took 33.02 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 16:38:18,535 INFO L168 Benchmark]: RCFGBuilder took 666.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.4 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-07 16:38:18,535 INFO L168 Benchmark]: TraceAbstraction took 267784.66 ms. Allocated memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: 547.9 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 546.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 16:38:18,537 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 340.66 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 25.13 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 33.02 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 666.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.4 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 267784.66 ms. Allocated memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: 547.9 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 546.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (580states) and FLOYD_HOARE automaton (currently 33 states, 48 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 87 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 56 locations, 1 error locations. TIMEOUT Result, 267.7s OverallTime, 17 OverallIterations, 15 TraceHistogramMax, 206.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 792 SDtfs, 3286 SDslu, 4223 SDs, 0 SdLazy, 6287 SolverSat, 953 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 66.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3238 GetRequests, 2649 SyntacticMatches, 36 SemanticMatches, 552 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14528 ImplicationChecksByTransitivity, 175.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=580occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9454242726969999 AbsIntWeakeningRatio, 0.5324675324675324 AbsIntAvgWeakeningVarsNumRemoved, 3.5194805194805197 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 754 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 57.2s InterpolantComputationTime, 2956 NumberOfCodeBlocks, 2832 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4277 ConstructedInterpolants, 97 QuantifiedInterpolants, 5104695 SizeOfPredicates, 68 NumberOfNonLiveVariables, 2536 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 41 InterpolantComputations, 3 PerfectInterpolantSequences, 6776/8900 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown