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/invert_string_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 09:00:29,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 09:00:29,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 09:00:29,198 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 09:00:29,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 09:00:29,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 09:00:29,201 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 09:00:29,202 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 09:00:29,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 09:00:29,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 09:00:29,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 09:00:29,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 09:00:29,207 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 09:00:29,208 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 09:00:29,209 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 09:00:29,210 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 09:00:29,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 09:00:29,212 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 09:00:29,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 09:00:29,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 09:00:29,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 09:00:29,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 09:00:29,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 09:00:29,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 09:00:29,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 09:00:29,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 09:00:29,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 09:00:29,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 09:00:29,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 09:00:29,225 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 09:00:29,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 09:00:29,226 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 09:00:29,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 09:00:29,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 09:00:29,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 09:00:29,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 09:00:29,228 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-27 09:00:29,253 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 09:00:29,254 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 09:00:29,254 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 09:00:29,255 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 09:00:29,255 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 09:00:29,255 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 09:00:29,255 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 09:00:29,256 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 09:00:29,256 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 09:00:29,256 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 09:00:29,256 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 09:00:29,256 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 09:00:29,256 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 09:00:29,257 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 09:00:29,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 09:00:29,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 09:00:29,259 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 09:00:29,259 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 09:00:29,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 09:00:29,259 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 09:00:29,259 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 09:00:29,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 09:00:29,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 09:00:29,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 09:00:29,260 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 09:00:29,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 09:00:29,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:00:29,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 09:00:29,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 09:00:29,262 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 09:00:29,262 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 09:00:29,262 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 09:00:29,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 09:00:29,262 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 09:00:29,263 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 09:00:29,263 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 09:00:29,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 09:00:29,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 09:00:29,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 09:00:29,348 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 09:00:29,349 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 09:00:29,349 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-10-27 09:00:29,418 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1fe312d5b/4da61442920f4d04a5dcbd57408c2dab/FLAGc3a605efb [2018-10-27 09:00:29,845 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 09:00:29,845 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-10-27 09:00:29,851 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1fe312d5b/4da61442920f4d04a5dcbd57408c2dab/FLAGc3a605efb [2018-10-27 09:00:29,866 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1fe312d5b/4da61442920f4d04a5dcbd57408c2dab [2018-10-27 09:00:29,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 09:00:29,879 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 09:00:29,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 09:00:29,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 09:00:29,884 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 09:00:29,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59421342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29, skipping insertion in model container [2018-10-27 09:00:29,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 09:00:29,920 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 09:00:30,147 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:00:30,153 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 09:00:30,183 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:00:30,214 INFO L193 MainTranslator]: Completed translation [2018-10-27 09:00:30,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30 WrapperNode [2018-10-27 09:00:30,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 09:00:30,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 09:00:30,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 09:00:30,216 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 09:00:30,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (1/1) ... [2018-10-27 09:00:30,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (1/1) ... [2018-10-27 09:00:30,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 09:00:30,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 09:00:30,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 09:00:30,276 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 09:00:30,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (1/1) ... [2018-10-27 09:00:30,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (1/1) ... [2018-10-27 09:00:30,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (1/1) ... [2018-10-27 09:00:30,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (1/1) ... [2018-10-27 09:00:30,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (1/1) ... [2018-10-27 09:00:30,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (1/1) ... [2018-10-27 09:00:30,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (1/1) ... [2018-10-27 09:00:30,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 09:00:30,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 09:00:30,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 09:00:30,333 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 09:00:30,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (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-27 09:00:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 09:00:30,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 09:00:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 09:00:30,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 09:00:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 09:00:30,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 09:00:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 09:00:30,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 09:00:30,964 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 09:00:30,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:00:30 BoogieIcfgContainer [2018-10-27 09:00:30,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 09:00:30,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 09:00:30,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 09:00:30,969 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 09:00:30,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 09:00:29" (1/3) ... [2018-10-27 09:00:30,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec1d674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:00:30, skipping insertion in model container [2018-10-27 09:00:30,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:30" (2/3) ... [2018-10-27 09:00:30,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec1d674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:00:30, skipping insertion in model container [2018-10-27 09:00:30,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:00:30" (3/3) ... [2018-10-27 09:00:30,973 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-10-27 09:00:30,984 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 09:00:30,998 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 09:00:31,017 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 09:00:31,057 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 09:00:31,057 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 09:00:31,057 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 09:00:31,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 09:00:31,058 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 09:00:31,058 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 09:00:31,058 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 09:00:31,058 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 09:00:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-10-27 09:00:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 09:00:31,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:31,082 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:31,084 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:31,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:31,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-10-27 09:00:31,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:31,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:31,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:31,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:31,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:31,250 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-27 09:00:31,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:31,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 09:00:31,253 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:31,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 09:00:31,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 09:00:31,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:00:31,272 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-10-27 09:00:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:31,294 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-10-27 09:00:31,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 09:00:31,296 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-10-27 09:00:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:31,304 INFO L225 Difference]: With dead ends: 51 [2018-10-27 09:00:31,305 INFO L226 Difference]: Without dead ends: 25 [2018-10-27 09:00:31,309 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-27 09:00:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-27 09:00:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-27 09:00:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 09:00:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-27 09:00:31,351 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-10-27 09:00:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:31,352 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-27 09:00:31,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 09:00:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-27 09:00:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 09:00:31,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:31,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:31,354 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:31,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-10-27 09:00:31,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:31,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:31,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:31,540 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-27 09:00:31,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:31,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 09:00:31,541 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:31,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:00:31,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:00:31,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:00:31,544 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-10-27 09:00:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:31,736 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-10-27 09:00:31,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:00:31,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-27 09:00:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:31,738 INFO L225 Difference]: With dead ends: 42 [2018-10-27 09:00:31,738 INFO L226 Difference]: Without dead ends: 28 [2018-10-27 09:00:31,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:00:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-27 09:00:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-27 09:00:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 09:00:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-10-27 09:00:31,745 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-10-27 09:00:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:31,746 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-27 09:00:31,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:00:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-10-27 09:00:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 09:00:31,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:31,747 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] [2018-10-27 09:00:31,748 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:31,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1585722772, now seen corresponding path program 1 times [2018-10-27 09:00:31,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:31,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:31,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:31,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:31,904 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-27 09:00:31,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:31,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 09:00:31,905 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:31,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:00:31,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:00:31,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:00:31,906 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2018-10-27 09:00:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:32,179 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-10-27 09:00:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:00:32,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-27 09:00:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:32,183 INFO L225 Difference]: With dead ends: 53 [2018-10-27 09:00:32,183 INFO L226 Difference]: Without dead ends: 35 [2018-10-27 09:00:32,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 09:00:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-27 09:00:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-10-27 09:00:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 09:00:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-27 09:00:32,194 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-10-27 09:00:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:32,195 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-27 09:00:32,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:00:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-27 09:00:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 09:00:32,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:32,196 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:32,196 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:32,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:32,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-10-27 09:00:32,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:32,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:32,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:32,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:32,199 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:32,639 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-10-27 09:00:33,293 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-10-27 09:00:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:33,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:33,379 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:33,380 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-27 09:00:33,382 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-10-27 09:00:33,422 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:00:33,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:00:33,746 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:00:33,750 INFO L272 AbstractInterpreter]: Visited 22 different actions 50 times. Merged at 11 different actions 21 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 40 variables. [2018-10-27 09:00:33,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:33,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:00:33,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:33,808 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-27 09:00:33,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:33,825 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:00:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:33,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:34,047 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 09:00:34,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 09:00:34,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-27 09:00:34,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-10-27 09:00:34,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 09:00:34,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-10-27 09:00:34,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 09:00:34,628 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:34,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 09:00:34,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 09:00:34,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,682 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-10-27 09:00:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:34,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:34,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-10-27 09:00:34,969 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 16 treesize of output 15 [2018-10-27 09:00:34,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 09:00:34,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:35,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:00:35,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:00:35,039 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2018-10-27 09:00:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:35,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:35,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2018-10-27 09:00:35,225 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:35,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 09:00:35,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 09:00:35,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-10-27 09:00:35,229 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 21 states. [2018-10-27 09:00:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:36,419 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-10-27 09:00:36,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 09:00:36,419 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-10-27 09:00:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:36,421 INFO L225 Difference]: With dead ends: 59 [2018-10-27 09:00:36,421 INFO L226 Difference]: Without dead ends: 57 [2018-10-27 09:00:36,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 09:00:36,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-27 09:00:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2018-10-27 09:00:36,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 09:00:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-10-27 09:00:36,432 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-10-27 09:00:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:36,432 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-10-27 09:00:36,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 09:00:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-10-27 09:00:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 09:00:36,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:36,433 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:36,434 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:36,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:36,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1367946380, now seen corresponding path program 2 times [2018-10-27 09:00:36,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:36,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:36,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:36,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:36,435 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:36,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:36,524 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:36,524 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:00:36,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:00:36,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:36,524 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-27 09:00:36,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:00:36,534 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:00:36,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 09:00:36,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:00:36,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:36,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 09:00:36,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:36,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:36,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 09:00:36,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-10-27 09:00:36,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 09:00:36,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:36,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:36,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:36,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-10-27 09:00:36,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 09:00:36,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 09:00:36,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:36,917 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:36,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-27 09:00:36,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:36,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:36,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:36,932 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2018-10-27 09:00:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 09:00:36,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:37,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2018-10-27 09:00:37,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 09:00:37,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:37,230 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 19 treesize of output 18 [2018-10-27 09:00:37,231 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:37,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:00:37,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:00:37,264 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2018-10-27 09:00:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 09:00:37,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:37,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 22 [2018-10-27 09:00:37,328 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:37,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 09:00:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 09:00:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-10-27 09:00:37,329 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 15 states. [2018-10-27 09:00:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:38,257 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-10-27 09:00:38,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 09:00:38,258 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-10-27 09:00:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:38,260 INFO L225 Difference]: With dead ends: 87 [2018-10-27 09:00:38,260 INFO L226 Difference]: Without dead ends: 63 [2018-10-27 09:00:38,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 09:00:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-27 09:00:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-10-27 09:00:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 09:00:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-27 09:00:38,271 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 27 [2018-10-27 09:00:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:38,272 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-27 09:00:38,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 09:00:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-27 09:00:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 09:00:38,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:38,273 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:38,274 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:38,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash 260616490, now seen corresponding path program 3 times [2018-10-27 09:00:38,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:38,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:00:38,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:38,276 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:38,657 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-10-27 09:00:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 09:00:38,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:38,954 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:38,954 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:00:38,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:00:38,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:38,955 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-27 09:00:38,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:00:38,967 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:00:38,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:00:38,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:00:39,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:39,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 09:00:39,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 09:00:39,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:39,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:39,026 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-27 09:00:39,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-27 09:00:39,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 09:00:39,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 09:00:39,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:39,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:39,105 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-27 09:00:39,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-27 09:00:39,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2018-10-27 09:00:39,215 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 19 treesize of output 18 [2018-10-27 09:00:39,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:39,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:39,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:39,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-27 09:00:39,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-10-27 09:00:39,470 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:39,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-10-27 09:00:39,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:39,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:39,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:39,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:36, output treesize:3 [2018-10-27 09:00:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 09:00:39,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:40,331 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-27 09:00:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 09:00:40,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:40,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2018-10-27 09:00:40,398 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:40,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 09:00:40,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 09:00:40,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-10-27 09:00:40,400 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 22 states. [2018-10-27 09:00:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:41,359 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-10-27 09:00:41,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 09:00:41,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-10-27 09:00:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:41,362 INFO L225 Difference]: With dead ends: 85 [2018-10-27 09:00:41,362 INFO L226 Difference]: Without dead ends: 83 [2018-10-27 09:00:41,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 09:00:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-27 09:00:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2018-10-27 09:00:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 09:00:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-10-27 09:00:41,373 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 30 [2018-10-27 09:00:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:41,374 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-10-27 09:00:41,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 09:00:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-10-27 09:00:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 09:00:41,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:41,375 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:41,376 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:41,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1439664076, now seen corresponding path program 4 times [2018-10-27 09:00:41,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:41,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:00:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:41,378 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:41,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:41,473 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:41,474 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:00:41,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:00:41,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:41,474 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-27 09:00:41,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:41,482 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:00:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:41,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:41,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:41,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:41,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2018-10-27 09:00:41,732 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:41,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 09:00:41,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 09:00:41,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 09:00:41,733 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 8 states. [2018-10-27 09:00:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:41,965 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-10-27 09:00:41,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 09:00:41,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-10-27 09:00:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:41,968 INFO L225 Difference]: With dead ends: 122 [2018-10-27 09:00:41,968 INFO L226 Difference]: Without dead ends: 96 [2018-10-27 09:00:41,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:00:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-27 09:00:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 58. [2018-10-27 09:00:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-27 09:00:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-10-27 09:00:41,980 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 33 [2018-10-27 09:00:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:41,981 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-10-27 09:00:41,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 09:00:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-10-27 09:00:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 09:00:41,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:41,982 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, 1, 1, 1, 1, 1] [2018-10-27 09:00:41,982 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:41,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:41,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1967307697, now seen corresponding path program 1 times [2018-10-27 09:00:41,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:41,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:41,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:41,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:41,984 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 09:00:42,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:42,098 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:42,099 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-10-27 09:00:42,099 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [46], [48], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2018-10-27 09:00:42,101 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:00:42,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:00:42,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:00:42,322 INFO L272 AbstractInterpreter]: Visited 27 different actions 93 times. Merged at 14 different actions 38 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 5 different actions. Largest state had 42 variables. [2018-10-27 09:00:42,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:42,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:00:42,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:42,371 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-27 09:00:42,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:42,383 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:00:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:42,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 09:00:42,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 09:00:42,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:42,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2018-10-27 09:00:42,539 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:42,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 09:00:42,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 09:00:42,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-27 09:00:42,540 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 7 states. [2018-10-27 09:00:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:42,677 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-10-27 09:00:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 09:00:42,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-10-27 09:00:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:42,679 INFO L225 Difference]: With dead ends: 96 [2018-10-27 09:00:42,679 INFO L226 Difference]: Without dead ends: 68 [2018-10-27 09:00:42,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-10-27 09:00:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-27 09:00:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2018-10-27 09:00:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-27 09:00:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-10-27 09:00:42,689 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 36 [2018-10-27 09:00:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:42,689 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-10-27 09:00:42,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 09:00:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-10-27 09:00:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 09:00:42,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:42,690 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:42,691 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:42,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash 144640967, now seen corresponding path program 5 times [2018-10-27 09:00:42,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:42,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:42,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:43,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:43,116 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:43,116 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:00:43,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:00:43,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:43,117 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-27 09:00:43,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:00:43,131 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:00:43,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 09:00:43,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:00:43,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:43,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 09:00:43,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 09:00:43,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 09:00:43,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 09:00:43,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,256 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-27 09:00:43,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-10-27 09:00:43,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 09:00:43,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 09:00:43,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,374 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-27 09:00:43,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-10-27 09:00:43,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 09:00:43,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 09:00:43,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,454 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-27 09:00:43,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-10-27 09:00:43,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-10-27 09:00:43,763 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 14 treesize of output 13 [2018-10-27 09:00:43,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:43,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-10-27 09:00:43,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-10-27 09:00:43,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-10-27 09:00:43,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:44,038 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 09:00:44,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:44,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:44,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:44,050 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-10-27 09:00:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 09:00:44,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:46,365 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 09:00:46,501 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:00:46,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:46,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:46,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:133, output treesize:1 [2018-10-27 09:00:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 09:00:46,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:46,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 38 [2018-10-27 09:00:46,531 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:46,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 09:00:46,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 09:00:46,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2018-10-27 09:00:46,533 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 27 states. [2018-10-27 09:00:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:48,787 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-10-27 09:00:48,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-27 09:00:48,788 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-10-27 09:00:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:48,790 INFO L225 Difference]: With dead ends: 137 [2018-10-27 09:00:48,791 INFO L226 Difference]: Without dead ends: 135 [2018-10-27 09:00:48,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=662, Invalid=3120, Unknown=0, NotChecked=0, Total=3782 [2018-10-27 09:00:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-27 09:00:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2018-10-27 09:00:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-27 09:00:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-10-27 09:00:48,808 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 36 [2018-10-27 09:00:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:48,809 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-10-27 09:00:48,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 09:00:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-10-27 09:00:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 09:00:48,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:48,811 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 09:00:48,811 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:48,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:48,812 INFO L82 PathProgramCache]: Analyzing trace with hash -669879850, now seen corresponding path program 2 times [2018-10-27 09:00:48,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:48,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:48,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:00:48,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:48,813 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 09:00:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 09:00:48,948 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 09:00:48,970 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,972 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,972 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,972 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,973 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,973 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,974 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,974 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,974 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,975 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,975 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,975 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,980 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,981 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,981 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,981 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,982 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,982 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,983 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,984 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,984 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,984 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,985 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,985 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,989 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,990 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,990 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,990 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,991 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,991 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,991 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,993 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,994 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,994 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,994 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,997 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,998 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,998 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,998 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,998 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:48,999 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,003 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,003 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,003 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,005 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,008 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,008 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 09:00:49,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 09:00:49 BoogieIcfgContainer [2018-10-27 09:00:49,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 09:00:49,041 INFO L168 Benchmark]: Toolchain (without parser) took 19162.40 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 887.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -180.1 MB). Peak memory consumption was 707.5 MB. Max. memory is 7.1 GB. [2018-10-27 09:00:49,042 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:00:49,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.05 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-27 09:00:49,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.38 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-27 09:00:49,044 INFO L168 Benchmark]: Boogie Preprocessor took 58.12 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-27 09:00:49,044 INFO L168 Benchmark]: RCFGBuilder took 631.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2018-10-27 09:00:49,047 INFO L168 Benchmark]: TraceAbstraction took 18074.59 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.0 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 612.7 MB). Peak memory consumption was 741.7 MB. Max. memory is 7.1 GB. [2018-10-27 09:00:49,053 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 335.05 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.38 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 58.12 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 631.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18074.59 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.0 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 612.7 MB). Peak memory consumption was 741.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int MAX = __VERIFIER_nondet_uint(); [L14] CALL char str1[MAX], str2[MAX]; [L14] RET char str1[MAX], str2[MAX]; [L14] RET char str1[MAX], str2[MAX]; [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 [L18] COND TRUE i= 0 [L26] CALL, EXPR str1[0] [L26] RET, EXPR str1[0] [L26] CALL str2[j] = str1[0] [L26] RET str2[j] = str1[0] [L27] j++ [L25] i-- [L25] COND TRUE i >= 0 [L26] CALL, EXPR str1[0] [L26] RET, EXPR str1[0] [L26] CALL str2[j] = str1[0] [L26] RET str2[j] = str1[0] [L27] j++ [L25] i-- [L25] COND FALSE !(i >= 0) [L30] j = MAX-1 [L31] i=0 [L31] COND TRUE i