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-EXP.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:23:52,090 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:23:52,092 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:23:52,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:23:52,105 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:23:52,106 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:23:52,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:23:52,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:23:52,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:23:52,112 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:23:52,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:23:52,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:23:52,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:23:52,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:23:52,117 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:23:52,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:23:52,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:23:52,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:23:52,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:23:52,128 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:23:52,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:23:52,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:23:52,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:23:52,143 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:23:52,143 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:23:52,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:23:52,145 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:23:52,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:23:52,151 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:23:52,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:23:52,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:23:52,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:23:52,156 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:23:52,157 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:23:52,158 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:23:52,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:23:52,160 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 12:23:52,188 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:23:52,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:23:52,189 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:23:52,189 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:23:52,189 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:23:52,190 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:23:52,190 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:23:52,190 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:23:52,190 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:23:52,190 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:23:52,191 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:23:52,191 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:23:52,191 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:23:52,191 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:23:52,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:23:52,192 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:23:52,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:23:52,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:23:52,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:23:52,193 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:23:52,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:23:52,194 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:23:52,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:23:52,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:23:52,194 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:23:52,194 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:23:52,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:23:52,195 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:23:52,195 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:23:52,195 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:23:52,197 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:23:52,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:23:52,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:23:52,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:23:52,198 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:23:52,198 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:23:52,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:23:52,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:23:52,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:23:52,293 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:23:52,294 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:23:52,295 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-24 12:23:52,363 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2b180c098/6d898487087b4aedb27fdf6428e3b53d/FLAG3d1bd7d67 [2018-10-24 12:23:52,859 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:23:52,860 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-24 12:23:52,868 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2b180c098/6d898487087b4aedb27fdf6428e3b53d/FLAG3d1bd7d67 [2018-10-24 12:23:52,884 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2b180c098/6d898487087b4aedb27fdf6428e3b53d [2018-10-24 12:23:52,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:23:52,897 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:23:52,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:23:52,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:23:52,903 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:23:52,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:23:52" (1/1) ... [2018-10-24 12:23:52,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e4f999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:52, skipping insertion in model container [2018-10-24 12:23:52,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:23:52" (1/1) ... [2018-10-24 12:23:52,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:23:52,946 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:23:53,167 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:23:53,172 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:23:53,211 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:23:53,244 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:23:53,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53 WrapperNode [2018-10-24 12:23:53,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:23:53,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:23:53,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:23:53,246 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:23:53,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:23:53,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:23:53,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:23:53,309 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:23:53,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:23:53,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:23:53,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:23:53,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:23:53,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (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-24 12:23:53,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:23:53,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:23:53,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:23:53,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:23:53,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:23:53,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:23:53,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:23:53,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:23:53,994 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:23:53,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:23:53 BoogieIcfgContainer [2018-10-24 12:23:53,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:23:53,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:23:53,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:23:54,000 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:23:54,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:23:52" (1/3) ... [2018-10-24 12:23:54,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0cf5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:23:54, skipping insertion in model container [2018-10-24 12:23:54,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (2/3) ... [2018-10-24 12:23:54,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0cf5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:23:54, skipping insertion in model container [2018-10-24 12:23:54,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:23:53" (3/3) ... [2018-10-24 12:23:54,004 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-10-24 12:23:54,016 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:23:54,025 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:23:54,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:23:54,081 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:23:54,082 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:23:54,082 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:23:54,082 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:23:54,082 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:23:54,082 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:23:54,083 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:23:54,083 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:23:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-10-24 12:23:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-24 12:23:54,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:54,109 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:54,111 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:54,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1403248464, now seen corresponding path program 1 times [2018-10-24 12:23:54,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:54,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:54,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:54,261 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-24 12:23:54,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:54,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:23:54,265 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:54,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:23:54,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:23:54,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:23:54,288 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-10-24 12:23:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:54,318 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-10-24 12:23:54,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:23:54,320 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-24 12:23:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:54,328 INFO L225 Difference]: With dead ends: 60 [2018-10-24 12:23:54,329 INFO L226 Difference]: Without dead ends: 28 [2018-10-24 12:23:54,332 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-24 12:23:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-24 12:23:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-24 12:23:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-24 12:23:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-10-24 12:23:54,372 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-10-24 12:23:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:54,372 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-10-24 12:23:54,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:23:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-10-24 12:23:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 12:23:54,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:54,374 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:54,374 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:54,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash 969867983, now seen corresponding path program 1 times [2018-10-24 12:23:54,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:54,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:54,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:54,584 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-24 12:23:54,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:54,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:23:54,584 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:54,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:23:54,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:23:54,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:23:54,587 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-10-24 12:23:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:54,741 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-10-24 12:23:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:23:54,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-24 12:23:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:54,743 INFO L225 Difference]: With dead ends: 52 [2018-10-24 12:23:54,743 INFO L226 Difference]: Without dead ends: 38 [2018-10-24 12:23:54,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:23:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-24 12:23:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-10-24 12:23:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-24 12:23:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-24 12:23:54,752 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-10-24 12:23:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:54,752 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-24 12:23:54,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:23:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-24 12:23:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 12:23:54,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:54,753 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:54,754 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:54,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:54,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1889876064, now seen corresponding path program 1 times [2018-10-24 12:23:54,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:54,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:54,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,756 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:55,299 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2018-10-24 12:23:55,542 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 16 [2018-10-24 12:23:55,790 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-10-24 12:23:56,222 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2018-10-24 12:23:56,409 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-24 12:23:56,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:23:56,410 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:23:56,411 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-24 12:23:56,413 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-24 12:23:56,451 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:23:56,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:23:57,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:23:57,012 INFO L272 AbstractInterpreter]: Visited 22 different actions 70 times. Merged at 12 different actions 36 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-24 12:23:57,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:57,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:23:57,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:23:57,059 INFO L194 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-24 12:23:57,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:57,072 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:23:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:57,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:23:57,427 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 28 treesize of output 23 [2018-10-24 12:23:57,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:23:57,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:23:57,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:23:57,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-24 12:23:57,616 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 37 treesize of output 29 [2018-10-24 12:23:57,625 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:23:57,626 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:23:57,629 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:23:57,630 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:23:57,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-24 12:23:57,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 12:23:57,808 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-24 12:23:57,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:23:58,188 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 43 treesize of output 37 [2018-10-24 12:23:58,335 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-10-24 12:23:58,345 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:23:58,378 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:23:58,379 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:23:58,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 48 [2018-10-24 12:23:58,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:23:58,408 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:23:58,413 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:23:58,413 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:23:58,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2018-10-24 12:23:58,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:23:58,434 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:23:58,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-24 12:23:58,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:23:58,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:23:58,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:23:58,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-24 12:23:58,566 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-24 12:23:58,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:23:58,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2018-10-24 12:23:58,599 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:23:58,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-24 12:23:58,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-24 12:23:58,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-10-24 12:23:58,602 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 20 states. [2018-10-24 12:24:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:00,108 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2018-10-24 12:24:00,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:24:00,109 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-10-24 12:24:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:00,112 INFO L225 Difference]: With dead ends: 99 [2018-10-24 12:24:00,112 INFO L226 Difference]: Without dead ends: 77 [2018-10-24 12:24:00,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 12:24:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-24 12:24:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2018-10-24 12:24:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-24 12:24:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-10-24 12:24:00,130 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 23 [2018-10-24 12:24:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:00,131 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2018-10-24 12:24:00,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-24 12:24:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-10-24 12:24:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 12:24:00,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:00,133 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:00,133 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:00,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1303070050, now seen corresponding path program 1 times [2018-10-24 12:24:00,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:00,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:00,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,135 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:00,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:00,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:24:00,244 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:00,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:24:00,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:24:00,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:24:00,246 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 5 states. [2018-10-24 12:24:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:00,342 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2018-10-24 12:24:00,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:24:00,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-24 12:24:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:00,349 INFO L225 Difference]: With dead ends: 137 [2018-10-24 12:24:00,349 INFO L226 Difference]: Without dead ends: 90 [2018-10-24 12:24:00,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-24 12:24:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2018-10-24 12:24:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-24 12:24:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-10-24 12:24:00,364 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 23 [2018-10-24 12:24:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:00,364 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-10-24 12:24:00,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:24:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-10-24 12:24:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-24 12:24:00,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:00,366 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] [2018-10-24 12:24:00,366 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:00,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:00,367 INFO L82 PathProgramCache]: Analyzing trace with hash -249426572, now seen corresponding path program 1 times [2018-10-24 12:24:00,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:00,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:00,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,368 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:00,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:00,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:00,983 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-24 12:24:00,984 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-24 12:24:00,986 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:00,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:01,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:01,349 INFO L272 AbstractInterpreter]: Visited 26 different actions 115 times. Merged at 16 different actions 62 times. Widened at 1 different actions 1 times. Found 13 fixpoints after 8 different actions. Largest state had 39 variables. [2018-10-24 12:24:01,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:01,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:01,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:01,381 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:01,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:01,398 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:01,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:01,662 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 41 treesize of output 34 [2018-10-24 12:24:01,675 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:01,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 12:24:01,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:01,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:01,706 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-24 12:24:01,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-10-24 12:24:01,815 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:01,816 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 52 treesize of output 54 [2018-10-24 12:24:01,839 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:01,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:01,842 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 54 treesize of output 61 [2018-10-24 12:24:01,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:01,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:01,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:24:01,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2018-10-24 12:24:01,922 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 28 treesize of output 20 [2018-10-24 12:24:01,929 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:01,930 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-24 12:24:01,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:01,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:01,934 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-24 12:24:01,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 12:24:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:01,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:06,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-10-24 12:24:06,835 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,839 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 62 treesize of output 69 [2018-10-24 12:24:06,904 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,905 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,905 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,906 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,907 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,908 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 78 [2018-10-24 12:24:06,925 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:24:06,929 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,931 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,932 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,933 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,934 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 83 [2018-10-24 12:24:06,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-24 12:24:06,966 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,966 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,967 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:06,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-10-24 12:24:06,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,019 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:72, output treesize:13 [2018-10-24 12:24:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:09,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:09,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 34 [2018-10-24 12:24:09,152 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:09,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 12:24:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 12:24:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=983, Unknown=3, NotChecked=0, Total=1122 [2018-10-24 12:24:09,153 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 22 states. [2018-10-24 12:24:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:10,539 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2018-10-24 12:24:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 12:24:10,540 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-10-24 12:24:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:10,544 INFO L225 Difference]: With dead ends: 152 [2018-10-24 12:24:10,545 INFO L226 Difference]: Without dead ends: 150 [2018-10-24 12:24:10,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=217, Invalid=1420, Unknown=3, NotChecked=0, Total=1640 [2018-10-24 12:24:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-24 12:24:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 75. [2018-10-24 12:24:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-24 12:24:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-10-24 12:24:10,561 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 29 [2018-10-24 12:24:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:10,561 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-10-24 12:24:10,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-24 12:24:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-10-24 12:24:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-24 12:24:10,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:10,563 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:10,563 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:10,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:10,564 INFO L82 PathProgramCache]: Analyzing trace with hash -853417747, now seen corresponding path program 1 times [2018-10-24 12:24:10,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:10,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:10,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:10,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:10,565 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:10,830 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-10-24 12:24:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:10,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:10,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:10,876 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-24 12:24:10,876 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-24 12:24:10,883 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:10,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:11,088 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:11,089 INFO L272 AbstractInterpreter]: Visited 27 different actions 116 times. Merged at 15 different actions 56 times. Widened at 2 different actions 3 times. Found 5 fixpoints after 4 different actions. Largest state had 39 variables. [2018-10-24 12:24:11,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:11,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:11,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:11,127 INFO L194 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-24 12:24:11,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:11,143 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:11,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:11,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:13,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:13,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-10-24 12:24:13,783 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:13,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:24:13,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:24:13,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2018-10-24 12:24:13,786 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 8 states. [2018-10-24 12:24:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:13,941 INFO L93 Difference]: Finished difference Result 142 states and 173 transitions. [2018-10-24 12:24:13,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:24:13,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-24 12:24:13,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:13,944 INFO L225 Difference]: With dead ends: 142 [2018-10-24 12:24:13,944 INFO L226 Difference]: Without dead ends: 123 [2018-10-24 12:24:13,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=49, Invalid=132, Unknown=1, NotChecked=0, Total=182 [2018-10-24 12:24:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-24 12:24:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2018-10-24 12:24:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-24 12:24:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-10-24 12:24:13,973 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 32 [2018-10-24 12:24:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:13,977 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-10-24 12:24:13,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:24:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-10-24 12:24:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 12:24:13,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:13,981 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:13,981 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:13,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:13,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1757852431, now seen corresponding path program 2 times [2018-10-24 12:24:13,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:13,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:13,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:13,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:13,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:14,806 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2018-10-24 12:24:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:15,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:15,018 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:15,019 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:15,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:15,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:15,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:15,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:15,034 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:15,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:24:15,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:15,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:15,287 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 24 treesize of output 19 [2018-10-24 12:24:15,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:15,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-10-24 12:24:15,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:15,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:15,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:24:15,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2018-10-24 12:24:15,401 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 25 treesize of output 18 [2018-10-24 12:24:15,403 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:15,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:15,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:15,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-10-24 12:24:15,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:15,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:15,427 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-24 12:24:15,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:17 [2018-10-24 12:24:15,456 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 26 treesize of output 18 [2018-10-24 12:24:15,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 12:24:15,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:15,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:15,461 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-24 12:24:15,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 12:24:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:15,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:19,374 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 49 treesize of output 43 [2018-10-24 12:24:19,377 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,379 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 43 treesize of output 50 [2018-10-24 12:24:19,507 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-24 12:24:19,510 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,513 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,514 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,516 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,517 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-10-24 12:24:19,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-24 12:24:19,549 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:24:19,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:19,552 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,553 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,554 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,555 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,556 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,577 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 2 case distinctions, treesize of input 40 treesize of output 81 [2018-10-24 12:24:19,580 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-24 12:24:19,584 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2018-10-24 12:24:19,604 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-24 12:24:19,631 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,644 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,645 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,646 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,647 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 81 [2018-10-24 12:24:19,670 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-24 12:24:19,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,675 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,675 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,677 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,678 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:19,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-10-24 12:24:19,702 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-24 12:24:19,704 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:24:19,704 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:19,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:24:19,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:24:19,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:24:19,843 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:62, output treesize:49 [2018-10-24 12:24:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:20,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:20,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 34 [2018-10-24 12:24:20,112 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:20,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-24 12:24:20,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-24 12:24:20,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=973, Unknown=1, NotChecked=0, Total=1122 [2018-10-24 12:24:20,114 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 20 states. [2018-10-24 12:24:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:21,314 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2018-10-24 12:24:21,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-24 12:24:21,315 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-10-24 12:24:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:21,317 INFO L225 Difference]: With dead ends: 194 [2018-10-24 12:24:21,317 INFO L226 Difference]: Without dead ends: 141 [2018-10-24 12:24:21,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=305, Invalid=1764, Unknown=1, NotChecked=0, Total=2070 [2018-10-24 12:24:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-24 12:24:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2018-10-24 12:24:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-24 12:24:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-10-24 12:24:21,334 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 31 [2018-10-24 12:24:21,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:21,335 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-10-24 12:24:21,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-24 12:24:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-10-24 12:24:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-24 12:24:21,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:21,340 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:21,340 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:21,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash 982712326, now seen corresponding path program 2 times [2018-10-24 12:24:21,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:21,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:21,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-24 12:24:21,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:21,421 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:21,421 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:21,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:21,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:21,422 INFO L194 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-24 12:24:21,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:21,432 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:21,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:24:21,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:21,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:21,627 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 41 treesize of output 34 [2018-10-24 12:24:21,675 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:21,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 12:24:21,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:21,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:21,781 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-24 12:24:21,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-24 12:24:21,906 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:21,907 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 52 treesize of output 54 [2018-10-24 12:24:21,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:21,914 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:21,915 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 54 treesize of output 61 [2018-10-24 12:24:21,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:21,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:21,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:24:21,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:35 [2018-10-24 12:24:22,051 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 36 treesize of output 28 [2018-10-24 12:24:22,054 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:22,055 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:22,056 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:22,057 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:22,059 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:22,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-10-24 12:24:22,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:22,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:22,084 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-24 12:24:22,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:5 [2018-10-24 12:24:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:24:22,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:24,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-10-24 12:24:24,601 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,628 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 62 treesize of output 69 [2018-10-24 12:24:24,742 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-10-24 12:24:24,746 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,746 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,747 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,749 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,750 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,751 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 78 [2018-10-24 12:24:24,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:24:24,770 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:24:24,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:24,773 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,773 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,774 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,775 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,776 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,776 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:24,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 78 [2018-10-24 12:24:24,793 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-24 12:24:24,826 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:24,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:24,841 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-24 12:24:24,841 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:75, output treesize:16 [2018-10-24 12:24:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:24:24,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:24,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 14] total 31 [2018-10-24 12:24:24,922 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:24,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:24:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:24:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=815, Unknown=1, NotChecked=0, Total=930 [2018-10-24 12:24:24,923 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 19 states. [2018-10-24 12:24:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:26,452 INFO L93 Difference]: Finished difference Result 213 states and 259 transitions. [2018-10-24 12:24:26,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-24 12:24:26,456 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-10-24 12:24:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:26,457 INFO L225 Difference]: With dead ends: 213 [2018-10-24 12:24:26,457 INFO L226 Difference]: Without dead ends: 134 [2018-10-24 12:24:26,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=393, Invalid=2468, Unknown=1, NotChecked=0, Total=2862 [2018-10-24 12:24:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-24 12:24:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2018-10-24 12:24:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-24 12:24:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-10-24 12:24:26,472 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 35 [2018-10-24 12:24:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:26,473 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-10-24 12:24:26,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:24:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-10-24 12:24:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 12:24:26,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:26,474 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:26,475 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:26,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash -289889213, now seen corresponding path program 1 times [2018-10-24 12:24:26,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:26,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:26,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:26,744 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-24 12:24:27,058 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:27,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:27,058 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:27,058 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-24 12:24:27,058 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-24 12:24:27,061 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:27,061 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:27,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:27,230 INFO L272 AbstractInterpreter]: Visited 25 different actions 91 times. Merged at 15 different actions 50 times. Widened at 2 different actions 2 times. Found 6 fixpoints after 4 different actions. Largest state had 39 variables. [2018-10-24 12:24:27,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:27,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:27,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:27,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:27,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:27,286 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:27,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:27,549 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 28 treesize of output 23 [2018-10-24 12:24:27,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:27,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:24:27,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:27,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:27,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:24:27,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-24 12:24:27,625 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 37 treesize of output 29 [2018-10-24 12:24:27,628 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:27,628 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:27,629 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:27,630 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:27,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-24 12:24:27,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:27,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:27,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:27,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 12:24:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:27,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:27,793 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 43 treesize of output 37 [2018-10-24 12:24:27,855 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:27,856 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:27,856 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:27,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 48 [2018-10-24 12:24:27,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:24:27,882 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:27,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-24 12:24:27,884 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:27,886 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:27,888 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:27,888 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:27,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2018-10-24 12:24:27,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-24 12:24:28,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:28,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:28,262 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-24 12:24:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:28,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:28,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2018-10-24 12:24:28,493 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:28,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 12:24:28,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 12:24:28,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2018-10-24 12:24:28,495 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 23 states. [2018-10-24 12:24:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:30,290 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2018-10-24 12:24:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-24 12:24:30,291 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-10-24 12:24:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:30,292 INFO L225 Difference]: With dead ends: 190 [2018-10-24 12:24:30,292 INFO L226 Difference]: Without dead ends: 147 [2018-10-24 12:24:30,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=558, Invalid=2304, Unknown=0, NotChecked=0, Total=2862 [2018-10-24 12:24:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-24 12:24:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 78. [2018-10-24 12:24:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-24 12:24:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-10-24 12:24:30,309 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 37 [2018-10-24 12:24:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:30,310 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-10-24 12:24:30,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 12:24:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-10-24 12:24:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 12:24:30,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:30,311 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:30,312 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:30,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:30,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1634323973, now seen corresponding path program 3 times [2018-10-24 12:24:30,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:30,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:30,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:30,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:30,313 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:31,491 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-10-24 12:24:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:31,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:31,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:31,531 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:31,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:31,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:31,531 INFO L194 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-24 12:24:31,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:31,539 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:31,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:31,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:31,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:31,720 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 25 treesize of output 21 [2018-10-24 12:24:31,724 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-10-24 12:24:31,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:31,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:31,764 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 16 treesize of output 13 [2018-10-24 12:24:31,766 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 13 treesize of output 12 [2018-10-24 12:24:31,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:31,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:31,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:31,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-10-24 12:24:31,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-10-24 12:24:31,917 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:31,918 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:31,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-10-24 12:24:31,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:31,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:31,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:24:31,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-10-24 12:24:31,999 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 29 treesize of output 22 [2018-10-24 12:24:32,002 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:32,003 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:32,004 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:32,005 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:32,009 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 22 treesize of output 61 [2018-10-24 12:24:32,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:32,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:32,143 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-24 12:24:32,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-10-24 12:24:32,286 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 28 treesize of output 20 [2018-10-24 12:24:32,323 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:24:32,324 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-24 12:24:32,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:32,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:32,371 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-24 12:24:32,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 12:24:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:32,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:39,961 WARN L179 SmtUtils]: Spent 841.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 12:24:50,588 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 51 treesize of output 47 [2018-10-24 12:24:50,591 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 47 treesize of output 43 [2018-10-24 12:24:50,593 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,596 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 43 treesize of output 51 [2018-10-24 12:24:50,669 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,670 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,674 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,675 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 86 [2018-10-24 12:24:50,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-10-24 12:24:50,715 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,717 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 46 [2018-10-24 12:24:50,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-24 12:24:50,731 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,732 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,735 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,736 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 85 [2018-10-24 12:24:50,834 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-10-24 12:24:50,859 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,873 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,895 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,895 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 83 [2018-10-24 12:24:50,921 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 6 xjuncts. [2018-10-24 12:24:50,925 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,926 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,933 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,933 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:50,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 85 [2018-10-24 12:24:50,982 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 6 xjuncts. [2018-10-24 12:24:51,017 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:51,026 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:51,036 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:51,039 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:51,074 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 83 [2018-10-24 12:24:51,077 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 6 xjuncts. [2018-10-24 12:24:51,086 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:51,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 52 [2018-10-24 12:24:51,116 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-10-24 12:24:51,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-24 12:24:51,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-24 12:24:51,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-24 12:24:51,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-24 12:24:51,596 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:77, output treesize:104 [2018-10-24 12:25:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:04,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:04,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 42 [2018-10-24 12:25:04,253 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:04,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-24 12:25:04,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-24 12:25:04,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1493, Unknown=15, NotChecked=0, Total=1722 [2018-10-24 12:25:04,255 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 26 states. [2018-10-24 12:25:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:05,063 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2018-10-24 12:25:05,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 12:25:05,063 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-10-24 12:25:05,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:05,065 INFO L225 Difference]: With dead ends: 119 [2018-10-24 12:25:05,065 INFO L226 Difference]: Without dead ends: 117 [2018-10-24 12:25:05,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=307, Invalid=2030, Unknown=15, NotChecked=0, Total=2352 [2018-10-24 12:25:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-24 12:25:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2018-10-24 12:25:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-24 12:25:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-10-24 12:25:05,078 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 37 [2018-10-24 12:25:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:05,078 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-10-24 12:25:05,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-24 12:25:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-10-24 12:25:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 12:25:05,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:05,080 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:25:05,080 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:05,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:05,080 INFO L82 PathProgramCache]: Analyzing trace with hash -411213956, now seen corresponding path program 2 times [2018-10-24 12:25:05,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:05,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:05,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:25:05,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:05,082 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:05,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:05,505 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:05,505 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:25:05,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:25:05,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:05,506 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:25:05,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:25:05,514 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:25:05,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:25:05,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:25:05,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:05,743 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 28 treesize of output 23 [2018-10-24 12:25:05,747 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:05,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:25:05,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:05,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:05,792 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-24 12:25:05,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-24 12:25:06,108 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 26 treesize of output 18 [2018-10-24 12:25:06,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 12:25:06,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:06,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:06,114 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-24 12:25:06,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 12:25:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:06,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:06,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-10-24 12:25:06,686 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:06,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-10-24 12:25:06,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:06,705 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:06,719 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:06,733 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:06,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 52 [2018-10-24 12:25:06,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:25:06,753 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:06,753 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:06,758 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:25:06,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 52 [2018-10-24 12:25:06,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-24 12:25:06,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:06,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:25:06,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:22 [2018-10-24 12:25:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:07,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:07,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 43 [2018-10-24 12:25:07,092 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:07,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-24 12:25:07,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-24 12:25:07,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1575, Unknown=0, NotChecked=0, Total=1806 [2018-10-24 12:25:07,093 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 32 states. [2018-10-24 12:25:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:20,444 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-10-24 12:25:20,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-24 12:25:20,444 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-10-24 12:25:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:20,446 INFO L225 Difference]: With dead ends: 136 [2018-10-24 12:25:20,446 INFO L226 Difference]: Without dead ends: 134 [2018-10-24 12:25:20,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=400, Invalid=2680, Unknown=0, NotChecked=0, Total=3080 [2018-10-24 12:25:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-24 12:25:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 85. [2018-10-24 12:25:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-24 12:25:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-10-24 12:25:20,461 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 40 [2018-10-24 12:25:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:20,461 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-10-24 12:25:20,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-24 12:25:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-10-24 12:25:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-24 12:25:20,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:20,462 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:25:20,463 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:20,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1027358850, now seen corresponding path program 3 times [2018-10-24 12:25:20,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:20,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:20,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:25:20,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:20,464 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:20,770 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-24 12:25:21,166 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 10 [2018-10-24 12:25:21,363 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-10-24 12:25:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:21,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:21,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:21,904 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:25:21,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:25:21,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:21,904 INFO L194 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-24 12:25:21,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:25:21,912 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:25:21,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:25:21,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:25:21,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:22,132 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 28 treesize of output 23 [2018-10-24 12:25:22,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:22,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:25:22,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:22,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:22,157 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-24 12:25:22,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-24 12:25:22,229 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 29 treesize of output 22 [2018-10-24 12:25:22,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:22,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:22,235 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:22,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2018-10-24 12:25:22,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:22,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:22,257 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-24 12:25:22,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-24 12:25:22,323 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 25 treesize of output 18 [2018-10-24 12:25:22,325 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:22,326 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:22,327 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:22,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-10-24 12:25:22,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:22,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:22,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:22,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:13 [2018-10-24 12:25:22,395 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 30 treesize of output 22 [2018-10-24 12:25:22,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:25:22,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-24 12:25:22,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:22,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:22,402 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-24 12:25:22,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-10-24 12:25:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:22,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:26:39,959 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 63 treesize of output 57 [2018-10-24 12:26:39,961 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:39,963 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 57 treesize of output 64 [2018-10-24 12:26:39,966 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:39,999 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 92 [2018-10-24 12:26:40,440 WARN L179 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-10-24 12:26:40,460 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,466 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,466 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 95 [2018-10-24 12:26:40,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 9 xjuncts. [2018-10-24 12:26:40,509 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,510 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 56 [2018-10-24 12:26:40,522 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-24 12:26:40,525 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,535 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,536 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 95 [2018-10-24 12:26:40,574 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 9 xjuncts. [2018-10-24 12:26:40,579 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,580 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,580 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 50 [2018-10-24 12:26:40,586 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:40,588 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,594 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,595 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 97 [2018-10-24 12:26:40,631 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 9 xjuncts. [2018-10-24 12:26:40,637 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,637 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,638 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,639 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,639 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,640 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 83 [2018-10-24 12:26:40,657 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-24 12:26:40,659 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,664 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,665 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:40,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 97 [2018-10-24 12:26:40,704 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 9 xjuncts. [2018-10-24 12:26:41,107 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:41,111 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:41,113 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:41,118 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:41,119 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:41,172 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 6 case distinctions, treesize of input 49 treesize of output 142 [2018-10-24 12:26:41,173 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:26:41,188 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 39 xjuncts. [2018-10-24 12:26:41,220 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:41,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 98 [2018-10-24 12:26:41,266 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 32 xjuncts. [2018-10-24 12:26:41,278 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:41,283 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:41,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 97 [2018-10-24 12:26:41,320 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 16 xjuncts. [2018-10-24 12:26:42,548 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:42,553 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:42,554 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:42,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 99 [2018-10-24 12:26:42,590 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 9 xjuncts. [2018-10-24 12:26:42,594 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:42,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 59 [2018-10-24 12:26:42,611 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-10-24 12:26:42,613 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:42,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 51 [2018-10-24 12:26:42,633 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-10-24 12:26:42,641 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:42,645 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:42,646 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:42,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 97 [2018-10-24 12:26:42,680 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 9 xjuncts. [2018-10-24 12:26:43,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-24 12:26:43,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-24 12:26:43,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-24 12:26:43,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 10 xjuncts. [2018-10-24 12:26:43,529 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:76, output treesize:145 [2018-10-24 12:26:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 23 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:43,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:26:43,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 40 [2018-10-24 12:26:43,641 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:26:43,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-24 12:26:43,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-24 12:26:43,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1327, Unknown=39, NotChecked=0, Total=1560 [2018-10-24 12:26:43,642 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 28 states. [2018-10-24 12:26:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:26:45,391 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2018-10-24 12:26:45,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-24 12:26:45,391 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-10-24 12:26:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:26:45,392 INFO L225 Difference]: With dead ends: 202 [2018-10-24 12:26:45,392 INFO L226 Difference]: Without dead ends: 157 [2018-10-24 12:26:45,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 80.2s TimeCoverageRelationStatistics Valid=418, Invalid=2513, Unknown=39, NotChecked=0, Total=2970 [2018-10-24 12:26:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-24 12:26:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2018-10-24 12:26:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-24 12:26:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-10-24 12:26:45,408 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-10-24 12:26:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:26:45,409 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-10-24 12:26:45,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-24 12:26:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-10-24 12:26:45,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 12:26:45,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:26:45,410 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:26:45,410 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:26:45,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1389059306, now seen corresponding path program 1 times [2018-10-24 12:26:45,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:26:45,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:45,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:26:45,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:45,412 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:26:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:45,973 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-10-24 12:26:46,206 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 19 [2018-10-24 12:26:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:46,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:46,756 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:26:46,756 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-24 12:26:46,756 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-24 12:26:46,758 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:26:46,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:26:46,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:26:46,857 INFO L272 AbstractInterpreter]: Visited 25 different actions 83 times. Merged at 15 different actions 43 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-24 12:26:46,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:46,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:26:46,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:46,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:26:46,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:26:46,901 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:26:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:46,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:26:47,127 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 28 treesize of output 23 [2018-10-24 12:26:47,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:26:47,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:47,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-24 12:26:47,289 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 32 treesize of output 25 [2018-10-24 12:26:47,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,293 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 12:26:47,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:47,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2018-10-24 12:26:47,444 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 32 treesize of output 25 [2018-10-24 12:26:47,447 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,451 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 12:26:47,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:47,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:27 [2018-10-24 12:26:47,520 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 37 treesize of output 29 [2018-10-24 12:26:47,523 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:47,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,526 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:47,526 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:26:47,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-10-24 12:26:47,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:47,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 12:26:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 12:26:47,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:27:44,067 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 55 treesize of output 49 [2018-10-24 12:27:44,069 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,071 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 49 treesize of output 56 [2018-10-24 12:27:44,074 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,103 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 79 [2018-10-24 12:27:44,352 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-10-24 12:27:44,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,359 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,361 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,366 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,367 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 126 [2018-10-24 12:27:44,418 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:27:44,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 39 xjuncts. [2018-10-24 12:27:44,432 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:27:44,432 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:44,434 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,438 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,441 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,446 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,463 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,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, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 124 [2018-10-24 12:27:44,553 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:27:44,564 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 39 xjuncts. [2018-10-24 12:27:44,581 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:27:44,581 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:44,587 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,591 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,594 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,600 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,601 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 126 [2018-10-24 12:27:44,653 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:27:44,664 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 39 xjuncts. [2018-10-24 12:27:44,668 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:27:44,668 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:44,670 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,675 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,680 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,681 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:44,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 124 [2018-10-24 12:27:44,733 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:27:44,742 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 39 xjuncts. [2018-10-24 12:27:45,963 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:45,969 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:45,970 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:45,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 92 [2018-10-24 12:27:46,003 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 9 xjuncts. [2018-10-24 12:27:46,162 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:46,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:46,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:46,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 97 [2018-10-24 12:27:46,205 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 9 xjuncts. [2018-10-24 12:27:46,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-24 12:27:46,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-24 12:27:46,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-24 12:27:46,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:27:46,406 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:76, output treesize:57 [2018-10-24 12:27:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:27:46,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:27:46,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 46 [2018-10-24 12:27:46,571 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:27:46,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 12:27:46,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 12:27:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1788, Unknown=27, NotChecked=0, Total=2070 [2018-10-24 12:27:46,573 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 31 states. [2018-10-24 12:27:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:27:48,419 INFO L93 Difference]: Finished difference Result 278 states and 325 transitions. [2018-10-24 12:27:48,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-24 12:27:48,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-24 12:27:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:27:48,422 INFO L225 Difference]: With dead ends: 278 [2018-10-24 12:27:48,422 INFO L226 Difference]: Without dead ends: 233 [2018-10-24 12:27:48,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 59.3s TimeCoverageRelationStatistics Valid=606, Invalid=3789, Unknown=27, NotChecked=0, Total=4422 [2018-10-24 12:27:48,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-24 12:27:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 140. [2018-10-24 12:27:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-24 12:27:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-10-24 12:27:48,444 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 45 [2018-10-24 12:27:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:27:48,444 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-10-24 12:27:48,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 12:27:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-10-24 12:27:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-24 12:27:48,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:27:48,445 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:27:48,445 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:27:48,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:27:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1009376150, now seen corresponding path program 1 times [2018-10-24 12:27:48,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:27:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:27:48,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:27:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:27:48,447 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:27:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:27:48,804 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-24 12:27:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:27:49,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:27:49,177 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:27:49,177 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-24 12:27:49,178 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-24 12:27:49,179 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:27:49,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:27:49,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:27:49,352 INFO L272 AbstractInterpreter]: Visited 30 different actions 149 times. Merged at 18 different actions 76 times. Widened at 4 different actions 6 times. Found 10 fixpoints after 7 different actions. Largest state had 40 variables. [2018-10-24 12:27:49,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:27:49,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:27:49,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:27:49,391 INFO L194 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) [2018-10-24 12:27:49,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:27:49,405 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:27:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:27:49,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:27:49,560 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 41 treesize of output 34 [2018-10-24 12:27:49,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:49,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 12:27:49,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:49,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:27:49,585 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-24 12:27:49,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-10-24 12:27:50,009 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:50,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-24 12:27:50,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:50,014 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:50,014 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:27:50,019 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:27:50,020 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 0 case distinctions, treesize of input 52 treesize of output 86 [2018-10-24 12:27:50,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:27:50,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:27:50,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 12:27:50,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:37 [2018-10-24 12:28:00,383 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 38 treesize of output 30 [2018-10-24 12:28:00,385 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:28:00,386 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:28:00,386 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:00,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:28:00,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2018-10-24 12:28:00,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:00,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:28:00,423 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-24 12:28:00,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-10-24 12:28:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:28:00,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:23,932 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 74 treesize of output 66 [2018-10-24 12:28:23,935 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:23,938 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 66 treesize of output 73 [2018-10-24 12:28:24,011 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,012 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,013 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,013 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,014 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,014 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,015 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,021 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,022 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 90 [2018-10-24 12:28:24,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:24,029 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,030 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,030 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,031 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,032 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,033 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,033 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,038 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,039 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-10-24 12:28:24,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:24,046 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,046 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,047 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-10-24 12:28:24,053 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:24,055 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,055 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,056 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,056 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,057 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,057 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,058 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,066 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 55 treesize of output 84 [2018-10-24 12:28:24,067 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:24,069 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,070 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,070 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,073 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,074 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-10-24 12:28:24,089 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-24 12:28:24,091 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,092 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,093 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,093 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,094 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,095 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,095 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,103 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,103 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 90 [2018-10-24 12:28:24,107 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:24,109 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,110 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,110 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,111 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,112 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:28:24,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2018-10-24 12:28:24,115 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-24 12:28:24,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:28:24,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:28:24,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:28:24,194 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:27 Received shutdown request... [2018-10-24 12:28:26,226 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 12:28:26,426 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:28:26,427 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:28:26,432 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:28:26,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:28:26 BoogieIcfgContainer [2018-10-24 12:28:26,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:28:26,433 INFO L168 Benchmark]: Toolchain (without parser) took 273537.21 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 940.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -846.2 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:26,434 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:28:26,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.75 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-24 12:28:26,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.61 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-24 12:28:26,434 INFO L168 Benchmark]: Boogie Preprocessor took 60.63 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-24 12:28:26,434 INFO L168 Benchmark]: RCFGBuilder took 628.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -759.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:26,435 INFO L168 Benchmark]: TraceAbstraction took 272436.17 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 228.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -97.0 MB). Peak memory consumption was 131.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:26,436 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 346.75 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 58.61 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 60.63 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 628.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -759.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 272436.17 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 228.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -97.0 MB). Peak memory consumption was 131.6 MB. 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 47 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 43 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. TIMEOUT Result, 272.3s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 448 SDtfs, 1214 SDslu, 3206 SDs, 0 SdLazy, 3827 SolverSat, 722 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 990 GetRequests, 482 SyntacticMatches, 46 SemanticMatches, 462 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 6658 ImplicationChecksByTransitivity, 199.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 569 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 205.4s InterpolantComputationTime, 748 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1063 ConstructedInterpolants, 164 QuantifiedInterpolants, 568222 SizeOfPredicates, 292 NumberOfNonLiveVariables, 1649 ConjunctsInSsa, 479 ConjunctsInUnsatCore, 33 InterpolantComputations, 3 PerfectInterpolantSequences, 92/518 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown