java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8c3fbe1 [2018-10-22 15:55:57,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 15:55:57,940 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 15:55:57,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 15:55:57,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 15:55:57,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 15:55:57,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 15:55:57,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 15:55:57,968 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 15:55:57,977 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 15:55:57,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 15:55:57,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 15:55:57,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 15:55:57,983 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 15:55:57,986 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 15:55:57,988 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 15:55:57,989 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 15:55:57,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 15:55:57,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 15:55:57,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 15:55:57,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 15:55:58,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 15:55:58,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 15:55:58,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 15:55:58,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 15:55:58,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 15:55:58,007 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 15:55:58,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 15:55:58,012 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 15:55:58,014 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 15:55:58,014 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 15:55:58,015 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 15:55:58,015 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 15:55:58,015 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 15:55:58,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 15:55:58,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 15:55:58,019 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-22 15:55:58,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 15:55:58,046 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 15:55:58,047 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 15:55:58,048 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 15:55:58,049 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 15:55:58,049 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 15:55:58,049 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 15:55:58,049 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 15:55:58,050 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-22 15:55:58,050 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 15:55:58,050 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 15:55:58,050 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 15:55:58,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 15:55:58,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 15:55:58,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 15:55:58,052 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 15:55:58,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 15:55:58,053 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 15:55:58,053 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 15:55:58,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 15:55:58,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 15:55:58,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 15:55:58,054 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 15:55:58,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 15:55:58,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 15:55:58,056 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 15:55:58,056 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 15:55:58,056 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 15:55:58,056 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 15:55:58,057 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 15:55:58,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 15:55:58,057 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 15:55:58,057 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-22 15:55:58,058 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-22 15:55:58,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 15:55:58,146 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 15:55:58,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 15:55:58,153 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 15:55:58,154 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 15:55:58,155 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-22 15:55:58,221 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/931d1431e/4edc6556a0924131bd86d15256f8d0d2/FLAGc4b2ed2a3 [2018-10-22 15:55:58,728 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 15:55:58,729 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-22 15:55:58,736 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/931d1431e/4edc6556a0924131bd86d15256f8d0d2/FLAGc4b2ed2a3 [2018-10-22 15:55:58,751 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/931d1431e/4edc6556a0924131bd86d15256f8d0d2 [2018-10-22 15:55:58,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 15:55:58,764 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-22 15:55:58,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 15:55:58,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 15:55:58,771 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 15:55:58,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:55:58" (1/1) ... [2018-10-22 15:55:58,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0fc450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:58, skipping insertion in model container [2018-10-22 15:55:58,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:55:58" (1/1) ... [2018-10-22 15:55:58,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 15:55:58,815 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 15:55:59,026 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:55:59,036 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 15:55:59,063 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:55:59,092 INFO L193 MainTranslator]: Completed translation [2018-10-22 15:55:59,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59 WrapperNode [2018-10-22 15:55:59,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 15:55:59,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 15:55:59,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 15:55:59,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 15:55:59,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (1/1) ... [2018-10-22 15:55:59,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (1/1) ... [2018-10-22 15:55:59,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 15:55:59,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 15:55:59,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 15:55:59,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 15:55:59,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (1/1) ... [2018-10-22 15:55:59,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (1/1) ... [2018-10-22 15:55:59,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (1/1) ... [2018-10-22 15:55:59,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (1/1) ... [2018-10-22 15:55:59,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (1/1) ... [2018-10-22 15:55:59,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (1/1) ... [2018-10-22 15:55:59,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (1/1) ... [2018-10-22 15:55:59,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 15:55:59,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 15:55:59,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 15:55:59,221 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 15:55:59,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:55:59,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 15:55:59,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 15:55:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 15:55:59,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 15:55:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-10-22 15:55:59,376 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-10-22 15:55:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 15:55:59,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 15:55:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 15:55:59,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 15:55:59,966 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 15:55:59,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:55:59 BoogieIcfgContainer [2018-10-22 15:55:59,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 15:55:59,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 15:55:59,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 15:55:59,971 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 15:55:59,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 03:55:58" (1/3) ... [2018-10-22 15:55:59,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34274fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:55:59, skipping insertion in model container [2018-10-22 15:55:59,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:55:59" (2/3) ... [2018-10-22 15:55:59,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34274fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:55:59, skipping insertion in model container [2018-10-22 15:55:59,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:55:59" (3/3) ... [2018-10-22 15:55:59,975 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-10-22 15:55:59,985 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 15:55:59,994 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 15:56:00,013 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 15:56:00,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 15:56:00,061 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 15:56:00,061 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 15:56:00,061 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 15:56:00,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 15:56:00,063 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 15:56:00,063 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 15:56:00,063 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 15:56:00,063 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 15:56:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-22 15:56:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-22 15:56:00,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:00,096 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:56:00,098 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:00,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash -82730588, now seen corresponding path program 1 times [2018-10-22 15:56:00,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:00,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:00,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:00,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:00,162 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:56:00,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:56:00,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 15:56:00,292 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:56:00,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 15:56:00,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 15:56:00,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 15:56:00,318 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-10-22 15:56:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:00,345 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-10-22 15:56:00,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 15:56:00,347 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-10-22 15:56:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:00,357 INFO L225 Difference]: With dead ends: 67 [2018-10-22 15:56:00,357 INFO L226 Difference]: Without dead ends: 33 [2018-10-22 15:56:00,361 INFO L605 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-10-22 15:56:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-22 15:56:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-22 15:56:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-22 15:56:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-22 15:56:00,398 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2018-10-22 15:56:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:00,398 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-22 15:56:00,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 15:56:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-22 15:56:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-22 15:56:00,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:00,400 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] [2018-10-22 15:56:00,400 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:00,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:00,401 INFO L82 PathProgramCache]: Analyzing trace with hash -802136646, now seen corresponding path program 1 times [2018-10-22 15:56:00,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:00,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:00,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:00,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:00,403 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:56:00,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:56:00,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:56:00,499 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:56:00,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:56:00,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:56:00,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:56:00,502 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-10-22 15:56:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:00,585 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-22 15:56:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:56:00,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-22 15:56:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:00,587 INFO L225 Difference]: With dead ends: 60 [2018-10-22 15:56:00,587 INFO L226 Difference]: Without dead ends: 36 [2018-10-22 15:56:00,588 INFO L605 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-10-22 15:56:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-22 15:56:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-22 15:56:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-22 15:56:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-10-22 15:56:00,596 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-10-22 15:56:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:00,597 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-10-22 15:56:00,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:56:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-10-22 15:56:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-22 15:56:00,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:00,598 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] [2018-10-22 15:56:00,598 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:00,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:00,599 INFO L82 PathProgramCache]: Analyzing trace with hash 306624109, now seen corresponding path program 1 times [2018-10-22 15:56:00,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:00,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:00,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:00,601 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:56:00,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:00,687 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:00,688 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-22 15:56:00,690 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [40], [41], [45], [48], [50], [52], [57], [61], [66], [76], [79], [81], [87], [88], [89], [91], [92], [93] [2018-10-22 15:56:00,750 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 15:56:00,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 15:56:01,447 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 15:56:01,449 INFO L272 AbstractInterpreter]: Visited 14 different actions 34 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-10-22 15:56:01,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:01,462 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 15:56:01,654 INFO L232 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 86.03% of their original sizes. [2018-10-22 15:56:01,655 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 15:56:02,005 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 15:56:02,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 15:56:02,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2018-10-22 15:56:02,006 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:56:02,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-22 15:56:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-22 15:56:02,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-22 15:56:02,008 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-10-22 15:56:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:03,268 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-10-22 15:56:03,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-22 15:56:03,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-22 15:56:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:03,273 INFO L225 Difference]: With dead ends: 62 [2018-10-22 15:56:03,273 INFO L226 Difference]: Without dead ends: 48 [2018-10-22 15:56:03,274 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-22 15:56:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-22 15:56:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-10-22 15:56:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-22 15:56:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-10-22 15:56:03,307 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-10-22 15:56:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:03,309 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-10-22 15:56:03,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-22 15:56:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-10-22 15:56:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-22 15:56:03,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:03,311 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] [2018-10-22 15:56:03,312 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:03,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:03,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1567947773, now seen corresponding path program 1 times [2018-10-22 15:56:03,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:03,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:03,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:03,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:03,316 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-22 15:56:03,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:03,434 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:03,435 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-22 15:56:03,435 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [34], [36], [40], [41], [45], [48], [50], [52], [57], [61], [66], [76], [79], [81], [87], [88], [89], [91], [92], [93] [2018-10-22 15:56:03,439 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 15:56:03,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 15:56:03,756 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 15:56:03,757 INFO L272 AbstractInterpreter]: Visited 17 different actions 37 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-10-22 15:56:03,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:03,796 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 15:56:03,930 INFO L232 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 69.64% of their original sizes. [2018-10-22 15:56:03,930 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 15:56:04,510 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 15:56:04,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 15:56:04,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2018-10-22 15:56:04,511 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 15:56:04,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-22 15:56:04,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-22 15:56:04,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-22 15:56:04,513 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 9 states. [2018-10-22 15:56:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:06,142 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-10-22 15:56:06,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-22 15:56:06,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-22 15:56:06,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:06,145 INFO L225 Difference]: With dead ends: 74 [2018-10-22 15:56:06,145 INFO L226 Difference]: Without dead ends: 52 [2018-10-22 15:56:06,148 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-22 15:56:06,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-22 15:56:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2018-10-22 15:56:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-22 15:56:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-10-22 15:56:06,171 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 30 [2018-10-22 15:56:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:06,172 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-10-22 15:56:06,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-22 15:56:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-10-22 15:56:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-22 15:56:06,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:06,179 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] [2018-10-22 15:56:06,179 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:06,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash -78169958, now seen corresponding path program 1 times [2018-10-22 15:56:06,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:06,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:06,182 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:56:06,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:06,324 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:06,324 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-10-22 15:56:06,325 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [23], [26], [30], [34], [36], [40], [41], [45], [48], [50], [52], [57], [61], [66], [76], [79], [81], [87], [88], [89], [91], [92], [93] [2018-10-22 15:56:06,328 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 15:56:06,328 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 15:56:07,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 15:56:07,564 INFO L272 AbstractInterpreter]: Visited 31 different actions 133 times. Merged at 12 different actions 79 times. Widened at 4 different actions 11 times. Found 10 fixpoints after 5 different actions. Largest state had 35 variables. [2018-10-22 15:56:07,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:07,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 15:56:07,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:07,605 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:56:07,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:07,623 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:56:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:07,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:56:07,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:56:08,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:08,055 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:56:08,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:08,098 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:56:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:08,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:56:08,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:56:08,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 15:56:08,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 6 [2018-10-22 15:56:08,305 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 15:56:08,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:56:08,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:56:08,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:56:08,307 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-10-22 15:56:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:08,521 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-10-22 15:56:08,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:56:08,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-10-22 15:56:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:08,523 INFO L225 Difference]: With dead ends: 71 [2018-10-22 15:56:08,524 INFO L226 Difference]: Without dead ends: 43 [2018-10-22 15:56:08,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:56:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-22 15:56:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-22 15:56:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-22 15:56:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-10-22 15:56:08,544 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2018-10-22 15:56:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:08,544 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-10-22 15:56:08,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:56:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-10-22 15:56:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-22 15:56:08,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:08,549 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:56:08,549 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:08,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:08,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2019809991, now seen corresponding path program 2 times [2018-10-22 15:56:08,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:08,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:08,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:08,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:08,553 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:56:08,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:08,725 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:08,726 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 15:56:08,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 15:56:08,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:08,726 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:56:08,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:56:08,746 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 15:56:08,806 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:56:08,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:08,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:56:08,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:56:09,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:09,272 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:56:09,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:56:09,289 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 15:56:09,407 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:56:09,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:09,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-22 15:56:09,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:10,075 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-22 15:56:10,270 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-22 15:56:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (5)] Exception during sending of exit command (exit): Broken pipe [2018-10-22 15:56:10,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 15:56:10,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 6] total 14 [2018-10-22 15:56:10,695 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 15:56:10,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 15:56:10,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 15:56:10,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-10-22 15:56:10,697 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-10-22 15:56:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:11,003 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-10-22 15:56:11,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 15:56:11,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-22 15:56:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:11,006 INFO L225 Difference]: With dead ends: 74 [2018-10-22 15:56:11,006 INFO L226 Difference]: Without dead ends: 46 [2018-10-22 15:56:11,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-10-22 15:56:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-22 15:56:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-22 15:56:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-22 15:56:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-10-22 15:56:11,033 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 37 [2018-10-22 15:56:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:11,034 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-10-22 15:56:11,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 15:56:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-10-22 15:56:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-22 15:56:11,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:11,035 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-10-22 15:56:11,035 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:11,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1718588038, now seen corresponding path program 3 times [2018-10-22 15:56:11,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:11,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:11,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:56:11,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:11,040 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:56:11,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:11,200 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:11,200 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 15:56:11,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 15:56:11,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:11,201 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:56:11,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:56:11,219 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-22 15:56:11,265 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-22 15:56:11,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:11,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-22 15:56:11,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-22 15:56:11,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:11,625 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:56:11,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:56:11,657 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-22 15:56:11,766 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-22 15:56:11,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:11,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-22 15:56:11,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:11,900 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-22 15:56:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-22 15:56:12,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 15:56:12,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6] total 13 [2018-10-22 15:56:12,002 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 15:56:12,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-22 15:56:12,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-22 15:56:12,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-10-22 15:56:12,004 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 9 states. [2018-10-22 15:56:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:12,355 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2018-10-22 15:56:12,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:56:12,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-10-22 15:56:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:12,357 INFO L225 Difference]: With dead ends: 91 [2018-10-22 15:56:12,357 INFO L226 Difference]: Without dead ends: 63 [2018-10-22 15:56:12,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 149 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-10-22 15:56:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-22 15:56:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-10-22 15:56:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-22 15:56:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-10-22 15:56:12,371 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 40 [2018-10-22 15:56:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:12,371 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-10-22 15:56:12,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-22 15:56:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-10-22 15:56:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-22 15:56:12,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:12,373 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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] [2018-10-22 15:56:12,373 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:12,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:12,373 INFO L82 PathProgramCache]: Analyzing trace with hash 894583805, now seen corresponding path program 4 times [2018-10-22 15:56:12,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:12,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:12,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:56:12,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:12,375 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-22 15:56:12,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:12,518 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:12,518 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 15:56:12,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 15:56:12,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:12,518 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:56:12,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:56:12,527 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-22 15:56:12,597 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:56:12,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:12,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-22 15:56:12,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-22 15:56:12,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:12,895 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:56:12,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:56:12,911 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-22 15:56:17,150 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:56:17,150 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:17,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-22 15:56:17,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-22 15:56:17,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 15:56:17,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 7 [2018-10-22 15:56:17,242 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 15:56:17,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-22 15:56:17,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-22 15:56:17,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-22 15:56:17,243 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 7 states. [2018-10-22 15:56:17,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:17,675 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-10-22 15:56:17,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-22 15:56:17,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-10-22 15:56:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:17,677 INFO L225 Difference]: With dead ends: 115 [2018-10-22 15:56:17,677 INFO L226 Difference]: Without dead ends: 79 [2018-10-22 15:56:17,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-22 15:56:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-22 15:56:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2018-10-22 15:56:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-22 15:56:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-10-22 15:56:17,691 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 49 [2018-10-22 15:56:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:17,691 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-10-22 15:56:17,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-22 15:56:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-10-22 15:56:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-22 15:56:17,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:17,693 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 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] [2018-10-22 15:56:17,693 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:17,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1943102000, now seen corresponding path program 5 times [2018-10-22 15:56:17,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:17,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:17,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:56:17,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:17,695 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-22 15:56:17,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:17,878 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:17,878 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 15:56:17,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 15:56:17,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:17,878 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:56:17,895 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:56:17,896 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 15:56:17,951 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-22 15:56:17,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:17,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-22 15:56:18,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-22 15:56:18,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:18,140 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:56:18,156 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:56:18,156 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 15:56:18,413 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-22 15:56:18,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:18,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-22 15:56:18,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-22 15:56:18,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 15:56:18,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7, 6, 7] total 15 [2018-10-22 15:56:18,499 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 15:56:18,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-22 15:56:18,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-22 15:56:18,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-10-22 15:56:18,501 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 11 states. [2018-10-22 15:56:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:18,735 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2018-10-22 15:56:18,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-22 15:56:18,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-10-22 15:56:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:18,736 INFO L225 Difference]: With dead ends: 91 [2018-10-22 15:56:18,736 INFO L226 Difference]: Without dead ends: 65 [2018-10-22 15:56:18,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2018-10-22 15:56:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-22 15:56:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-22 15:56:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-22 15:56:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-10-22 15:56:18,749 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 52 [2018-10-22 15:56:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:18,750 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-10-22 15:56:18,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-22 15:56:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-10-22 15:56:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-22 15:56:18,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:18,751 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 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] [2018-10-22 15:56:18,751 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:18,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:18,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1870453241, now seen corresponding path program 6 times [2018-10-22 15:56:18,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:18,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:18,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:56:18,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:18,753 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-22 15:56:18,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:18,984 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:18,984 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 15:56:18,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 15:56:18,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:18,984 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:56:18,992 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-22 15:56:18,992 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-10-22 15:56:19,067 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-22 15:56:19,067 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:19,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-22 15:56:19,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-22 15:56:19,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:19,557 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:56:19,574 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-22 15:56:19,575 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-10-22 15:56:20,131 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-22 15:56:20,132 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:20,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-22 15:56:20,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-22 15:56:20,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 15:56:20,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7, 6, 7] total 18 [2018-10-22 15:56:20,342 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 15:56:20,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-22 15:56:20,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-22 15:56:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-10-22 15:56:20,343 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 11 states. [2018-10-22 15:56:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:20,777 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2018-10-22 15:56:20,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-22 15:56:20,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-10-22 15:56:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:20,782 INFO L225 Difference]: With dead ends: 121 [2018-10-22 15:56:20,782 INFO L226 Difference]: Without dead ends: 99 [2018-10-22 15:56:20,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=727, Unknown=0, NotChecked=0, Total=1056 [2018-10-22 15:56:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-22 15:56:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2018-10-22 15:56:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-22 15:56:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-10-22 15:56:20,800 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 56 [2018-10-22 15:56:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:20,800 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-10-22 15:56:20,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-22 15:56:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-10-22 15:56:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-22 15:56:20,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:20,802 INFO L375 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:56:20,802 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:20,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:20,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1283302351, now seen corresponding path program 7 times [2018-10-22 15:56:20,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:20,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:20,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:56:20,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:20,804 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-10-22 15:56:20,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:20,914 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:20,914 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 15:56:20,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 15:56:20,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:20,914 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:56:20,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:20,924 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:56:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:20,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 66 proven. 8 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-22 15:56:21,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 66 proven. 8 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-22 15:56:21,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:21,231 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:56:21,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:21,247 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:56:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:21,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 66 proven. 8 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-22 15:56:21,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:21,575 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-22 15:56:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 66 proven. 8 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-22 15:56:21,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 15:56:21,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8, 7, 8] total 16 [2018-10-22 15:56:21,680 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 15:56:21,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-22 15:56:21,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-22 15:56:21,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-10-22 15:56:21,682 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 10 states. [2018-10-22 15:56:22,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:22,314 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2018-10-22 15:56:22,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-22 15:56:22,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-10-22 15:56:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:22,317 INFO L225 Difference]: With dead ends: 155 [2018-10-22 15:56:22,318 INFO L226 Difference]: Without dead ends: 101 [2018-10-22 15:56:22,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 326 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2018-10-22 15:56:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-22 15:56:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-10-22 15:56:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-22 15:56:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-10-22 15:56:22,340 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 84 [2018-10-22 15:56:22,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:22,341 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-10-22 15:56:22,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-22 15:56:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-10-22 15:56:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-22 15:56:22,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:22,343 INFO L375 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 6, 6, 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] [2018-10-22 15:56:22,343 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:22,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash -581563780, now seen corresponding path program 8 times [2018-10-22 15:56:22,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:22,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:22,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:56:22,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:22,345 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-22 15:56:22,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:22,868 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:22,869 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 15:56:22,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 15:56:22,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:22,869 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:56:22,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:56:22,884 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 15:56:22,989 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:56:22,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:22,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 18 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-22 15:56:23,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 18 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-22 15:56:23,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:23,707 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:56:23,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:56:23,746 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 15:56:23,970 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:56:23,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:23,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 18 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-22 15:56:24,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:24,185 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-22 15:56:24,367 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-22 15:56:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 18 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-22 15:56:24,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 15:56:24,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9, 8, 9] total 19 [2018-10-22 15:56:24,566 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 15:56:24,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 15:56:24,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 15:56:24,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-10-22 15:56:24,568 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 13 states. [2018-10-22 15:56:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:56:24,969 INFO L93 Difference]: Finished difference Result 177 states and 207 transitions. [2018-10-22 15:56:24,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-22 15:56:24,970 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-10-22 15:56:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:56:24,972 INFO L225 Difference]: With dead ends: 177 [2018-10-22 15:56:24,972 INFO L226 Difference]: Without dead ends: 113 [2018-10-22 15:56:24,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 365 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2018-10-22 15:56:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-22 15:56:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-10-22 15:56:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-22 15:56:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2018-10-22 15:56:24,987 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 94 [2018-10-22 15:56:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:56:24,988 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-10-22 15:56:24,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 15:56:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2018-10-22 15:56:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-22 15:56:24,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:56:24,990 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 6, 6, 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] [2018-10-22 15:56:24,991 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:56:24,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:56:24,991 INFO L82 PathProgramCache]: Analyzing trace with hash 507095466, now seen corresponding path program 9 times [2018-10-22 15:56:24,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:56:24,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:24,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:56:24,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:56:24,992 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:56:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:56:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 220 proven. 24 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-22 15:56:25,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:25,156 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:56:25,156 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 15:56:25,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 15:56:25,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:25,156 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:56:25,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:56:25,165 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-22 15:56:25,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-22 15:56:25,284 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:56:25,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:56:25,337 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-10-22 15:56:25,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,452 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 31 treesize of output 28 [2018-10-22 15:56:25,464 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 28 treesize of output 31 [2018-10-22 15:56:25,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,483 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 31 treesize of output 39 [2018-10-22 15:56:25,517 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,523 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,525 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,526 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2018-10-22 15:56:25,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,585 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,603 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,605 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,606 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 35 treesize of output 79 [2018-10-22 15:56:25,641 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,642 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,644 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,646 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,648 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,650 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,650 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,651 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,652 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,653 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,660 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-10-22 15:56:25,662 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,691 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,740 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,758 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:44, output treesize:46 [2018-10-22 15:56:25,811 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,812 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:25,812 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-10-22 15:56:25,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:48 [2018-10-22 15:56:25,872 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 46 treesize of output 47 [2018-10-22 15:56:25,886 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-10-22 15:56:25,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:48 [2018-10-22 15:56:25,955 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 46 treesize of output 47 [2018-10-22 15:56:25,958 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-10-22 15:56:25,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:25,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:48 [2018-10-22 15:56:26,006 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 46 treesize of output 47 [2018-10-22 15:56:26,010 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-10-22 15:56:26,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:48 [2018-10-22 15:56:26,057 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 50 treesize of output 51 [2018-10-22 15:56:26,063 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-10-22 15:56:26,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:48 [2018-10-22 15:56:26,139 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 48 treesize of output 49 [2018-10-22 15:56:26,156 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 10 treesize of output 9 [2018-10-22 15:56:26,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:48 [2018-10-22 15:56:26,310 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 35 treesize of output 27 [2018-10-22 15:56:26,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:26,315 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:26,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:26,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:26,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:26,319 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:56:26,321 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 27 treesize of output 46 [2018-10-22 15:56:26,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:10 [2018-10-22 15:56:26,887 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-22 15:56:26,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:56:26,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:1 [2018-10-22 15:56:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 77 proven. 61 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-10-22 15:56:26,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:56:27,117 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-10-22 15:56:28,284 WARN L179 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-22 15:56:57,370 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-22 15:56:57,680 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-22 15:56:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 35 proven. 125 refuted. 7 times theorem prover too weak. 177 trivial. 0 not checked. [2018-10-22 15:56:57,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:56:57,897 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:56:57,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:56:57,919 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-22 15:58:24,179 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-22 15:58:24,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:58:24,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:58:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 210 proven. 50 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-22 15:58:24,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:58:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 210 proven. 50 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-22 15:58:24,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 15:58:24,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 23, 9, 9] total 49 [2018-10-22 15:58:24,480 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 15:58:24,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-22 15:58:24,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-22 15:58:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2024, Unknown=13, NotChecked=0, Total=2352 [2018-10-22 15:58:24,483 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand 26 states. [2018-10-22 15:58:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:58:26,141 INFO L93 Difference]: Finished difference Result 216 states and 253 transitions. [2018-10-22 15:58:26,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-22 15:58:26,141 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2018-10-22 15:58:26,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:58:26,143 INFO L225 Difference]: With dead ends: 216 [2018-10-22 15:58:26,143 INFO L226 Difference]: Without dead ends: 129 [2018-10-22 15:58:26,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 368 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=550, Invalid=3343, Unknown=13, NotChecked=0, Total=3906 [2018-10-22 15:58:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-22 15:58:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-10-22 15:58:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-22 15:58:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2018-10-22 15:58:26,162 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 102 [2018-10-22 15:58:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:58:26,163 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2018-10-22 15:58:26,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-22 15:58:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2018-10-22 15:58:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-22 15:58:26,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:58:26,164 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 9, 6, 6, 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] [2018-10-22 15:58:26,164 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:58:26,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:58:26,165 INFO L82 PathProgramCache]: Analyzing trace with hash -713193213, now seen corresponding path program 1 times [2018-10-22 15:58:26,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 15:58:26,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:58:26,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:58:26,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:58:26,166 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 15:58:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:58:26,844 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 6 [2018-10-22 15:58:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-10-22 15:58:27,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:58:27,427 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 15:58:27,427 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2018-10-22 15:58:27,427 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [23], [26], [28], [30], [34], [36], [40], [41], [45], [48], [50], [52], [57], [61], [66], [76], [79], [81], [87], [88], [89], [91], [92], [93] [2018-10-22 15:58:27,430 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 15:58:27,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 15:58:28,595 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 15:58:28,595 INFO L272 AbstractInterpreter]: Visited 32 different actions 174 times. Merged at 13 different actions 104 times. Widened at 4 different actions 13 times. Found 22 fixpoints after 7 different actions. Largest state had 35 variables. [2018-10-22 15:58:28,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:58:28,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 15:58:28,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:58:28,612 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:58:28,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:58:28,623 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:58:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:58:28,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:58:29,069 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 57 treesize of output 48 [2018-10-22 15:58:29,073 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,074 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,078 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2018-10-22 15:58:29,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,089 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 91 [2018-10-22 15:58:29,091 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:29,106 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:29,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:29,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:29,124 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:27 [2018-10-22 15:58:29,322 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-10-22 15:58:29,325 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,326 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,327 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,328 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,330 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,331 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:29,332 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-10-22 15:58:29,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:29,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:29,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:29,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:5 [2018-10-22 15:58:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 143 proven. 150 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-22 15:58:29,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 15:58:30,307 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 139 treesize of output 125 [2018-10-22 15:58:30,315 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:30,324 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:30,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 181 [2018-10-22 15:58:31,456 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 202 DAG size of output: 129 [2018-10-22 15:58:31,466 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-22 15:58:31,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:31,468 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,490 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,490 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,491 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,491 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,492 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,492 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,492 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,502 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,507 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,526 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 183 [2018-10-22 15:58:31,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-10-22 15:58:31,535 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,536 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,536 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,538 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:31,538 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,539 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,539 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,543 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,544 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,550 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 140 [2018-10-22 15:58:31,554 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:31,557 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-22 15:58:31,557 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:31,559 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-22 15:58:31,559 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:31,563 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,567 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,569 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,570 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,570 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,571 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,572 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,575 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,578 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,587 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,596 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,602 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,605 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 266 [2018-10-22 15:58:31,649 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-22 15:58:31,687 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 10 xjuncts. [2018-10-22 15:58:31,691 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,696 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,698 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,698 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,700 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,700 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,702 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,702 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,706 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,708 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,721 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,729 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,733 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,776 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 5 case distinctions, treesize of input 101 treesize of output 261 [2018-10-22 15:58:31,794 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 9 xjuncts. [2018-10-22 15:58:31,820 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,879 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,888 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,895 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,896 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,901 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,901 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,905 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,906 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,908 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,916 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,927 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,931 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,934 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:31,938 INFO L303 Elim1Store]: Index analysis took 143 ms [2018-10-22 15:58:31,973 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 5 case distinctions, treesize of input 98 treesize of output 265 [2018-10-22 15:58:31,992 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 9 xjuncts. [2018-10-22 15:58:32,008 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-22 15:58:32,008 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:32,613 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,613 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,614 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,614 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,614 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,615 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,623 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 109 [2018-10-22 15:58:32,626 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:32,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,630 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,632 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,633 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,634 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,634 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,649 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,650 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,650 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,663 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 2 case distinctions, treesize of input 93 treesize of output 190 [2018-10-22 15:58:32,667 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-10-22 15:58:32,795 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:32,795 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,796 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,797 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,799 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,803 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,804 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,808 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 165 [2018-10-22 15:58:32,828 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-10-22 15:58:32,949 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,950 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,950 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,953 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:58:32,955 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 66 [2018-10-22 15:58:32,956 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:33,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:58:33,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:58:33,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:58:33,081 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 4 variables, input treesize:139, output treesize:80 [2018-10-22 15:58:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 249 proven. 42 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-22 15:58:33,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:58:33,210 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 15:58:33,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:58:33,228 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 15:58:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:58:33,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:58:33,477 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-10-22 15:58:33,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:33,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:33,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-22 15:58:33,486 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:33,487 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:33,488 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-10-22 15:58:33,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:33,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:33,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-22 15:58:34,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-10-22 15:58:34,040 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-10-22 15:58:34,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:34,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:34,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:34,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-22 15:58:34,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2018-10-22 15:58:34,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-10-22 15:58:34,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:34,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:34,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:58:34,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-22 15:58:34,267 WARN L854 $PredicateComparison]: unable to prove that (exists ((SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (|SelectionSort_write~int_#ptr.offset| Int) (|SelectionSort_write~int_#value| Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)) |c_#memory_int|)) is different from true [2018-10-22 15:58:34,310 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (v_prenex_5 Int) (|SelectionSort_write~int_#ptr.offset| Int) (|SelectionSort_write~int_#value| Int) (v_prenex_8 Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)) |c_#memory_int|)) is different from true [2018-10-22 15:58:34,362 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (v_prenex_5 Int) (|SelectionSort_write~int_#ptr.offset| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|SelectionSort_write~int_#value| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ |c_~#array~0.offset| (* 4 v_prenex_9)) v_prenex_10) v_prenex_11 v_prenex_12) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)))) is different from true [2018-10-22 15:58:34,417 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_16 Int) (v_prenex_15 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (|SelectionSort_write~int_#ptr.offset| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|SelectionSort_write~int_#value| Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ |c_~#array~0.offset| (* 4 v_prenex_9)) v_prenex_10) v_prenex_11 v_prenex_12) (+ |c_~#array~0.offset| (* 4 v_prenex_13)) v_prenex_14) v_prenex_15 v_prenex_16) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)) |c_#memory_int|)) is different from true [2018-10-22 15:58:34,466 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_16 Int) (v_prenex_15 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|SelectionSort_write~int_#ptr.offset| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_20 Int) (v_prenex_8 Int) (v_prenex_9 Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_19 Int) (|SelectionSort_write~int_#value| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ |c_~#array~0.offset| (* 4 v_prenex_9)) v_prenex_10) v_prenex_11 v_prenex_12) (+ |c_~#array~0.offset| (* 4 v_prenex_13)) v_prenex_14) v_prenex_15 v_prenex_16) (+ (* 4 v_prenex_17) |c_~#array~0.offset|) v_prenex_18) v_prenex_19 v_prenex_20) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)))) is different from true [2018-10-22 15:58:34,574 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 66 treesize of output 67 [2018-10-22 15:58:34,582 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 55 treesize of output 58 [2018-10-22 15:58:34,611 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 68 [2018-10-22 15:58:34,642 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 76 [2018-10-22 15:58:34,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 98 [2018-10-22 15:58:34,725 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:34,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 76 treesize of output 114 [2018-10-22 15:58:34,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:34,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 92 treesize of output 122 [2018-10-22 15:58:34,823 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:34,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 106 treesize of output 164 [2018-10-22 15:58:34,944 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:34,949 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:35,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 168 [2018-10-22 15:58:35,028 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-22 15:58:35,028 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:35,323 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:35,327 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:35,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 164 [2018-10-22 15:58:35,400 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-22 15:58:35,400 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:35,675 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:35,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:35,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:35,730 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 0 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 175 [2018-10-22 15:58:35,734 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 8 xjuncts. [2018-10-22 15:58:36,685 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:36,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:36,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:36,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 163 [2018-10-22 15:58:36,751 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-10-22 15:58:37,339 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:37,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:37,354 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:37,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 108 treesize of output 215 [2018-10-22 15:58:37,465 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-22 15:58:37,504 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 128 xjuncts. [2018-10-22 15:58:39,849 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:39,851 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:39,856 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:39,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 163 [2018-10-22 15:58:39,950 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-10-22 15:58:42,204 INFO L267 ElimStorePlain]: Start of recursive call 12: 8 dim-1 vars, End of recursive call: and 17 xjuncts. [2018-10-22 15:58:44,175 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:44,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:44,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:44,242 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 106 treesize of output 168 [2018-10-22 15:58:44,287 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-22 15:58:44,288 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-22 15:58:44,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:45,002 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:45,005 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:45,067 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 0 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 175 [2018-10-22 15:58:45,069 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 8 xjuncts. [2018-10-22 15:58:45,479 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:45,480 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:45,483 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:45,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 163 [2018-10-22 15:58:45,535 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 8 xjuncts. [2018-10-22 15:58:46,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:46,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:46,093 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:46,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 163 [2018-10-22 15:58:46,146 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 8 xjuncts. [2018-10-22 15:58:47,635 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:47,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:47,641 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:47,666 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-10-22 15:58:47,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 108 treesize of output 215 [2018-10-22 15:58:47,734 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-22 15:58:47,763 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 128 xjuncts. [2018-10-22 15:58:49,820 INFO L267 ElimStorePlain]: Start of recursive call 18: 8 dim-1 vars, End of recursive call: and 17 xjuncts. [2018-10-22 15:58:51,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:51,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:51,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 156 [2018-10-22 15:58:51,644 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:51,655 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:51,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 124 treesize of output 223 [2018-10-22 15:58:51,749 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-22 15:58:51,775 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 128 xjuncts. [2018-10-22 15:58:54,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:54,924 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:54,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 159 [2018-10-22 15:58:54,977 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 8 xjuncts. [2018-10-22 15:58:56,847 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:56,848 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:56,852 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:56,902 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 0 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 179 [2018-10-22 15:58:56,905 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 8 xjuncts. [2018-10-22 15:58:57,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:57,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:57,663 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:58:57,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 167 [2018-10-22 15:58:57,711 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 8 xjuncts. [2018-10-22 15:58:58,519 INFO L267 ElimStorePlain]: Start of recursive call 24: 8 dim-1 vars, End of recursive call: and 17 xjuncts. [2018-10-22 15:59:03,770 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:03,776 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:03,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 108 treesize of output 202 [2018-10-22 15:59:03,896 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-22 15:59:03,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:03,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:03,994 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:59:04,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 143 treesize of output 191 [2018-10-22 15:59:04,032 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 8 xjuncts. [2018-10-22 15:59:14,941 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:14,942 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:14,947 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:15,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 131 treesize of output 214 [2018-10-22 15:59:15,040 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 32 xjuncts. [2018-10-22 15:59:22,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:22,568 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:22,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:22,572 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:22,595 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:59:22,596 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:59:22,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 126 treesize of output 196 [2018-10-22 15:59:22,671 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 16 xjuncts. [2018-10-22 15:59:45,754 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:45,756 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:45,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:45,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 127 treesize of output 198 [2018-10-22 15:59:45,849 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 32 xjuncts. [2018-10-22 15:59:54,640 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:54,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:59:54,671 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:59:54,672 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:59:54,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 120 treesize of output 240 [2018-10-22 15:59:54,793 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-22 15:59:54,830 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 128 xjuncts. Received shutdown request... [2018-10-22 16:00:21,995 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-22 16:00:22,195 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 16:00:22,196 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-22 16:00:22,202 WARN L205 ceAbstractionStarter]: Timeout [2018-10-22 16:00:22,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 04:00:22 BoogieIcfgContainer [2018-10-22 16:00:22,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 16:00:22,203 INFO L168 Benchmark]: Toolchain (without parser) took 263439.93 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 986.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -354.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-22 16:00:22,204 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 16:00:22,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.17 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-10-22 16:00:22,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.00 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-10-22 16:00:22,205 INFO L168 Benchmark]: Boogie Preprocessor took 68.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-10-22 16:00:22,205 INFO L168 Benchmark]: RCFGBuilder took 748.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2018-10-22 16:00:22,205 INFO L168 Benchmark]: TraceAbstraction took 262234.54 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 253.2 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 398.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-22 16:00:22,207 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.17 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 56.00 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 68.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. * RCFGBuilder took 748.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 262234.54 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 253.2 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 398.3 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 analyzing trace of length 107 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 667. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. TIMEOUT Result, 262.1s OverallTime, 14 OverallIterations, 15 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 425 SDtfs, 820 SDslu, 1464 SDs, 0 SdLazy, 1141 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2365 GetRequests, 2120 SyntacticMatches, 39 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 37.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.6s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9549741124260354 AbsIntWeakeningRatio, 1.8653846153846154 AbsIntAvgWeakeningVarsNumRemoved, 121.5576923076923 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 76 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 92.6s SatisfiabilityAnalysisTime, 40.5s InterpolantComputationTime, 1738 NumberOfCodeBlocks, 1660 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 2785 ConstructedInterpolants, 18 QuantifiedInterpolants, 985237 SizeOfPredicates, 82 NumberOfNonLiveVariables, 5250 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 49 InterpolantComputations, 2 PerfectInterpolantSequences, 4269/4966 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown