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-d380424 [2018-10-24 12:23:52,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:23:52,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:23:52,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:23:52,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:23:52,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:23:52,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:23:52,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:23:52,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:23:52,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:23:52,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:23:52,147 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:23:52,148 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:23:52,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:23:52,150 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:23:52,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:23:52,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:23:52,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:23:52,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:23:52,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:23:52,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:23:52,160 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:23:52,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:23:52,163 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:23:52,163 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:23:52,164 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:23:52,165 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:23:52,166 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:23:52,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:23:52,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:23:52,174 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:23:52,175 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:23:52,175 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:23:52,175 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:23:52,176 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:23:52,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:23:52,177 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 12:23:52,204 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:23:52,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:23:52,207 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:23:52,207 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:23:52,208 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:23:52,208 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:23:52,208 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:23:52,209 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:23:52,209 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:23:52,209 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:23:52,209 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:23:52,209 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:23:52,210 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:23:52,210 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:23:52,211 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:23:52,211 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:23:52,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:23:52,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:23:52,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:23:52,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:23:52,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:23:52,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:23:52,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:23:52,217 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:23:52,217 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:23:52,217 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:23:52,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:23:52,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:23:52,218 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:23:52,218 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:23:52,218 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:23:52,218 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:23:52,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:23:52,219 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:23:52,220 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:23:52,220 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:23:52,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:23:52,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:23:52,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:23:52,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:23:52,296 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:23:52,297 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-24 12:23:52,366 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ccb7b579a/aed633526a214169a8c57351acf7b159/FLAGcbbc2b326 [2018-10-24 12:23:52,807 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:23:52,807 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-10-24 12:23:52,814 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ccb7b579a/aed633526a214169a8c57351acf7b159/FLAGcbbc2b326 [2018-10-24 12:23:52,833 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ccb7b579a/aed633526a214169a8c57351acf7b159 [2018-10-24 12:23:52,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:23:52,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:23:52,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:23:52,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:23:52,854 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:23:52,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:23:52" (1/1) ... [2018-10-24 12:23:52,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5132971b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:52, skipping insertion in model container [2018-10-24 12:23:52,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:23:52" (1/1) ... [2018-10-24 12:23:52,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:23:52,896 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:23:53,117 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:23:53,121 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:23:53,146 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:23:53,167 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:23:53,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53 WrapperNode [2018-10-24 12:23:53,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:23:53,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:23:53,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:23:53,168 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:23:53,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:23:53,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:23:53,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:23:53,209 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:23:53,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:23:53,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:23:53,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:23:53,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:23:53,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:23:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:23:53,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:23:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:23:53,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:23:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:23:53,387 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:23:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:23:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:23:53,821 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:23:53,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:23:53 BoogieIcfgContainer [2018-10-24 12:23:53,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:23:53,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:23:53,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:23:53,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:23:53,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:23:52" (1/3) ... [2018-10-24 12:23:53,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490b6d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:23:53, skipping insertion in model container [2018-10-24 12:23:53,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (2/3) ... [2018-10-24 12:23:53,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490b6d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:23:53, skipping insertion in model container [2018-10-24 12:23:53,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:23:53" (3/3) ... [2018-10-24 12:23:53,831 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-10-24 12:23:53,841 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:23:53,853 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:23:53,872 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:23:53,911 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:23:53,912 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:23:53,912 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:23:53,912 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:23:53,912 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:23:53,912 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:23:53,912 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:23:53,912 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:23:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-10-24 12:23:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 12:23:53,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:53,936 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:53,938 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:53,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-10-24 12:23:53,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:53,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:53,993 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:23:54,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:54,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:23:54,096 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:54,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:23:54,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:23:54,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:23:54,117 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-10-24 12:23:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:54,139 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-10-24 12:23:54,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:23:54,141 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-10-24 12:23:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:54,151 INFO L225 Difference]: With dead ends: 51 [2018-10-24 12:23:54,151 INFO L226 Difference]: Without dead ends: 25 [2018-10-24 12:23:54,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:23:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-24 12:23:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-24 12:23:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-24 12:23:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-24 12:23:54,200 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-10-24 12:23:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:54,201 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-24 12:23:54,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:23:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-24 12:23:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 12:23:54,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:54,202 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-24 12:23:54,203 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:54,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-10-24 12:23:54,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:54,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:54,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,205 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:23:54,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:54,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:23:54,595 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:54,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:23:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:23:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:23:54,599 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-10-24 12:23:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:54,828 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-10-24 12:23:54,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:23:54,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-24 12:23:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:54,830 INFO L225 Difference]: With dead ends: 42 [2018-10-24 12:23:54,830 INFO L226 Difference]: Without dead ends: 28 [2018-10-24 12:23:54,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:23:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-24 12:23:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-24 12:23:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-24 12:23:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-10-24 12:23:54,838 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-10-24 12:23:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:54,839 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-24 12:23:54,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:23:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-10-24 12:23:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:23:54,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:54,840 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-24 12:23:54,840 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:54,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:54,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1585722772, now seen corresponding path program 1 times [2018-10-24 12:23:54,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:54,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:54,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,843 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:23:55,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:55,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:23:55,031 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:55,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:23:55,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:23:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:23:55,034 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2018-10-24 12:23:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:55,308 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-10-24 12:23:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:23:55,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-24 12:23:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:55,311 INFO L225 Difference]: With dead ends: 53 [2018-10-24 12:23:55,312 INFO L226 Difference]: Without dead ends: 35 [2018-10-24 12:23:55,312 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-24 12:23:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-24 12:23:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-10-24 12:23:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-24 12:23:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-24 12:23:55,323 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-10-24 12:23:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:55,324 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-24 12:23:55,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:23:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-24 12:23:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 12:23:55,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:55,325 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-24 12:23:55,326 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:55,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-10-24 12:23:55,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:55,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:55,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:55,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:55,746 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-10-24 12:23:56,424 WARN L179 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-10-24 12:23:56,507 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-24 12:23:56,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:23:56,507 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:23:56,508 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-24 12:23:56,510 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-24 12:23:56,549 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:23:56,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:23:57,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:23:57,231 INFO L272 AbstractInterpreter]: Visited 22 different actions 99 times. Merged at 12 different actions 53 times. Widened at 1 different actions 2 times. Found 6 fixpoints after 5 different actions. Largest state had 40 variables. [2018-10-24 12:23:57,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:57,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:23:57,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:23:57,280 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:23:57,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:57,294 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:23:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:57,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:23:57,406 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-24 12:23:57,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-24 12:23:57,661 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-24 12:23:57,668 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-24 12:23:57,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-10-24 12:23:57,814 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-24 12:23:57,819 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:23:57,820 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-24 12:23:57,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,841 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-24 12:23:57,842 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:23:57,880 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-24 12:23:57,881 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-10-24 12:23:58,001 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-24 12:23:58,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:23:58,145 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-24 12:23:58,189 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-24 12:23:58,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:23:58,215 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-24 12:23:58,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:23:58,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:23:58,265 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-24 12:23:58,265 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2018-10-24 12:23:58,528 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-24 12:23:58,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:23:58,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2018-10-24 12:23:58,551 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:23:58,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 12:23:58,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 12:23:58,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-10-24 12:23:58,555 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 21 states. [2018-10-24 12:23:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:59,704 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-10-24 12:23:59,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 12:23:59,705 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-10-24 12:23:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:59,707 INFO L225 Difference]: With dead ends: 59 [2018-10-24 12:23:59,707 INFO L226 Difference]: Without dead ends: 57 [2018-10-24 12:23:59,709 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-24 12:23:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-24 12:23:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2018-10-24 12:23:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-24 12:23:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-10-24 12:23:59,720 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-10-24 12:23:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:59,720 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-10-24 12:23:59,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 12:23:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-10-24 12:23:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 12:23:59,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:59,723 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-24 12:23:59,723 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:59,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1367946380, now seen corresponding path program 2 times [2018-10-24 12:23:59,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:59,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:59,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:59,847 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-24 12:23:59,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:23:59,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:23:59,848 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:23:59,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:23:59,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:23:59,849 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:23:59,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:23:59,859 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:23:59,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:23:59,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:23:59,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:23:59,929 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-24 12:23:59,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:23:59,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:23:59,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-24 12:23:59,996 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-24 12:24:00,000 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-24 12:24:00,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:00,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:00,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:00,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-10-24 12:24:00,244 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-24 12:24:00,249 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-24 12:24:00,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:00,275 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:00,276 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-24 12:24:00,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:00,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:00,288 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-24 12:24:00,288 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2018-10-24 12:24:00,327 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-24 12:24:00,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:00,496 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-24 12:24:00,554 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-24 12:24:00,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:00,585 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-24 12:24:00,585 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:00,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:24:00,618 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-24 12:24:00,619 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2018-10-24 12:24:00,664 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-24 12:24:00,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:00,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 22 [2018-10-24 12:24:00,686 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:00,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:24:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:24:00,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:24:00,687 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 15 states. [2018-10-24 12:24:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:01,718 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-10-24 12:24:01,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-24 12:24:01,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-10-24 12:24:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:01,720 INFO L225 Difference]: With dead ends: 87 [2018-10-24 12:24:01,720 INFO L226 Difference]: Without dead ends: 63 [2018-10-24 12:24:01,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=0, NotChecked=0, Total=1482 [2018-10-24 12:24:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-24 12:24:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-10-24 12:24:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-24 12:24:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-24 12:24:01,734 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 27 [2018-10-24 12:24:01,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:01,734 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-24 12:24:01,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:24:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-24 12:24:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-24 12:24:01,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:01,735 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-24 12:24:01,736 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:01,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:01,736 INFO L82 PathProgramCache]: Analyzing trace with hash 260616490, now seen corresponding path program 3 times [2018-10-24 12:24:01,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:01,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:01,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:01,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:01,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:02,084 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-10-24 12:24:02,395 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-24 12:24:02,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:02,396 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:02,396 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:02,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:02,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:02,397 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:02,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:02,406 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:02,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:02,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:02,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:02,488 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-24 12:24:02,495 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-24 12:24:02,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-24 12:24:02,541 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-24 12:24:02,544 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-24 12:24:02,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-24 12:24:02,618 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-24 12:24:02,623 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-24 12:24:02,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-24 12:24:02,782 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-24 12:24:02,786 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:02,788 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-24 12:24:02,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,805 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-24 12:24:02,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:36, output treesize:3 [2018-10-24 12:24:02,841 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-24 12:24:02,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:03,728 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-24 12:24:03,754 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-24 12:24:03,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:03,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2018-10-24 12:24:03,783 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:03,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 12:24:03,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 12:24:03,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-10-24 12:24:03,784 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 22 states. [2018-10-24 12:24:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:04,825 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-10-24 12:24:04,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 12:24:04,825 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-10-24 12:24:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:04,830 INFO L225 Difference]: With dead ends: 85 [2018-10-24 12:24:04,830 INFO L226 Difference]: Without dead ends: 83 [2018-10-24 12:24:04,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2018-10-24 12:24:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-24 12:24:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2018-10-24 12:24:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-24 12:24:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-10-24 12:24:04,841 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 30 [2018-10-24 12:24:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:04,842 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-10-24 12:24:04,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-24 12:24:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-10-24 12:24:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 12:24:04,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:04,843 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-24 12:24:04,844 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:04,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1439664076, now seen corresponding path program 4 times [2018-10-24 12:24:04,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:04,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:04,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:04,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:04,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:04,942 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-24 12:24:04,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:04,943 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:04,943 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:04,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:04,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:04,943 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:04,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:04,952 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:04,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:04,991 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-24 12:24:04,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:05,186 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-24 12:24:05,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:05,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2018-10-24 12:24:05,207 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:05,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:24:05,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:24:05,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 12:24:05,208 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 8 states. [2018-10-24 12:24:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:05,410 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-10-24 12:24:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:24:05,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-10-24 12:24:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:05,413 INFO L225 Difference]: With dead ends: 122 [2018-10-24 12:24:05,413 INFO L226 Difference]: Without dead ends: 96 [2018-10-24 12:24:05,414 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-24 12:24:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-24 12:24:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 58. [2018-10-24 12:24:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-24 12:24:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-10-24 12:24:05,425 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 33 [2018-10-24 12:24:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:05,426 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-10-24 12:24:05,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:24:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-10-24 12:24:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 12:24:05,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:05,427 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-24 12:24:05,428 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:05,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:05,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1967307697, now seen corresponding path program 1 times [2018-10-24 12:24:05,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:05,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:05,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:05,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:05,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:05,529 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-24 12:24:05,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:05,529 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:05,529 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-10-24 12:24:05,530 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-24 12:24:05,532 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:05,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:05,752 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:05,753 INFO L272 AbstractInterpreter]: Visited 27 different actions 156 times. Merged at 15 different actions 78 times. Widened at 2 different actions 9 times. Found 12 fixpoints after 5 different actions. Largest state had 42 variables. [2018-10-24 12:24:05,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:05,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:05,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:05,791 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:05,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:05,806 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:05,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:05,856 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-24 12:24:05,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:06,017 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-24 12:24:06,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:06,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2018-10-24 12:24:06,038 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:06,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:24:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:24:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:06,039 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 7 states. [2018-10-24 12:24:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:06,174 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-10-24 12:24:06,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:24:06,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-10-24 12:24:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:06,176 INFO L225 Difference]: With dead ends: 96 [2018-10-24 12:24:06,176 INFO L226 Difference]: Without dead ends: 68 [2018-10-24 12:24:06,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:24:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-24 12:24:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2018-10-24 12:24:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-24 12:24:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-10-24 12:24:06,187 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 36 [2018-10-24 12:24:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:06,188 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-10-24 12:24:06,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:24:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-10-24 12:24:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 12:24:06,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:06,189 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-24 12:24:06,190 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:06,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash 144640967, now seen corresponding path program 5 times [2018-10-24 12:24:06,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:06,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:06,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:06,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:06,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:06,401 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-24 12:24:06,668 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-24 12:24:06,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:06,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:06,668 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:06,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:06,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:06,669 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:06,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:06,684 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:06,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:24:06,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:06,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:06,748 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-24 12:24:06,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:06,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:06,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-24 12:24:06,777 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-24 12:24:06,781 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-24 12:24:06,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:06,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:06,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:06,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-10-24 12:24:06,888 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-24 12:24:06,899 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-24 12:24:06,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:06,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:06,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:06,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-10-24 12:24:06,993 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-24 12:24:06,996 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-24 12:24:06,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-10-24 12:24:07,262 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-24 12:24:07,265 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-24 12:24:07,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-10-24 12:24:07,453 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-24 12:24:07,465 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-24 12:24:07,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,564 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:07,565 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-24 12:24:07,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:07,575 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-24 12:24:07,575 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-10-24 12:24:07,590 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-24 12:24:07,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:09,914 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 29 [2018-10-24 12:24:10,084 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:24:10,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:10,085 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-24 12:24:10,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:133, output treesize:1 [2018-10-24 12:24:10,102 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-24 12:24:10,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:10,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 38 [2018-10-24 12:24:10,124 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:10,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-24 12:24:10,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-24 12:24:10,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2018-10-24 12:24:10,125 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 27 states. [2018-10-24 12:24:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:12,458 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-10-24 12:24:12,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-24 12:24:12,458 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-10-24 12:24:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:12,460 INFO L225 Difference]: With dead ends: 137 [2018-10-24 12:24:12,460 INFO L226 Difference]: Without dead ends: 135 [2018-10-24 12:24:12,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=662, Invalid=3120, Unknown=0, NotChecked=0, Total=3782 [2018-10-24 12:24:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-24 12:24:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2018-10-24 12:24:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-24 12:24:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-10-24 12:24:12,476 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 36 [2018-10-24 12:24:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:12,477 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-10-24 12:24:12,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-24 12:24:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-10-24 12:24:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-24 12:24:12,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:12,478 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-24 12:24:12,479 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:12,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash -669879850, now seen corresponding path program 2 times [2018-10-24 12:24:12,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:12,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:12,480 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 12:24:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 12:24:12,555 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-24 12:24:12,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,578 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,578 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,578 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,578 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,579 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,579 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,579 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,581 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,581 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,581 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,590 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,591 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,591 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,591 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,592 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,592 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,592 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,593 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,593 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,593 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,594 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,594 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,596 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,596 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,596 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,597 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,597 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,597 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,598 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,598 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,599 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,599 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,599 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,600 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,600 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,600 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,601 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,601 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,602 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,602 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,602 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,603 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 12:24:12,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:24:12 BoogieIcfgContainer [2018-10-24 12:24:12,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:24:12,632 INFO L168 Benchmark]: Toolchain (without parser) took 19786.31 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:24:12,633 INFO L168 Benchmark]: CDTParser took 0.22 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-24 12:24:12,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:24:12,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:24:12,634 INFO L168 Benchmark]: Boogie Preprocessor took 29.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:24:12,635 INFO L168 Benchmark]: RCFGBuilder took 584.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-10-24 12:24:12,635 INFO L168 Benchmark]: TraceAbstraction took 18807.56 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 309.3 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -285.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2018-10-24 12:24:12,639 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.22 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 319.22 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 39.92 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 29.07 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 584.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18807.56 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 309.3 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -285.9 MB). Peak memory consumption was 23.4 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