./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0210da8c Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i ../../../trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 922bc5e57819a2e5059028ce62005da2daf2559b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-21 12:24:54,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-21 12:24:54,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-21 12:24:54,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-21 12:24:54,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-21 12:24:54,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-21 12:24:54,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-21 12:24:54,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-21 12:24:54,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-21 12:24:54,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-21 12:24:54,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-21 12:24:54,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-21 12:24:54,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-21 12:24:54,532 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-21 12:24:54,534 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-21 12:24:54,535 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-21 12:24:54,536 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-21 12:24:54,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-21 12:24:54,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-21 12:24:54,542 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-21 12:24:54,543 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-21 12:24:54,545 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-21 12:24:54,548 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-21 12:24:54,548 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-21 12:24:54,548 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-21 12:24:54,550 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-21 12:24:54,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-21 12:24:54,552 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-21 12:24:54,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-21 12:24:54,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-21 12:24:54,555 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-21 12:24:54,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-21 12:24:54,556 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-21 12:24:54,556 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-21 12:24:54,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-21 12:24:54,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-21 12:24:54,558 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-21 12:24:54,574 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-21 12:24:54,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-21 12:24:54,575 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-21 12:24:54,575 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-21 12:24:54,576 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-21 12:24:54,576 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-21 12:24:54,576 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-21 12:24:54,576 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-21 12:24:54,576 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-21 12:24:54,577 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-21 12:24:54,578 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-21 12:24:54,579 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-21 12:24:54,579 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-21 12:24:54,579 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-21 12:24:54,579 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-21 12:24:54,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-21 12:24:54,580 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-21 12:24:54,580 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-21 12:24:54,580 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-21 12:24:54,580 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-21 12:24:54,580 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-21 12:24:54,581 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-21 12:24:54,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-21 12:24:54,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-21 12:24:54,581 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-21 12:24:54,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-21 12:24:54,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-21 12:24:54,583 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-21 12:24:54,583 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-21 12:24:54,584 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-21 12:24:54,584 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-21 12:24:54,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-21 12:24:54,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-21 12:24:54,585 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-21 12:24:54,585 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UTaipan-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 922bc5e57819a2e5059028ce62005da2daf2559b [2018-10-21 12:24:54,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-21 12:24:54,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-21 12:24:54,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-21 12:24:54,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-21 12:24:54,669 INFO L276 PluginConnector]: CDTParser initialized [2018-10-21 12:24:54,670 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i [2018-10-21 12:24:54,741 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a773d90ee/0639e79d9cf048d1a60c7e581c1df843/FLAGa0dca991c [2018-10-21 12:24:55,217 INFO L298 CDTParser]: Found 1 translation units. [2018-10-21 12:24:55,217 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i [2018-10-21 12:24:55,227 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a773d90ee/0639e79d9cf048d1a60c7e581c1df843/FLAGa0dca991c [2018-10-21 12:24:55,243 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a773d90ee/0639e79d9cf048d1a60c7e581c1df843 [2018-10-21 12:24:55,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-21 12:24:55,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-21 12:24:55,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-21 12:24:55,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-21 12:24:55,254 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-21 12:24:55,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241d7add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55, skipping insertion in model container [2018-10-21 12:24:55,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-21 12:24:55,297 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-21 12:24:55,481 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:24:55,485 INFO L189 MainTranslator]: Completed pre-run [2018-10-21 12:24:55,509 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:24:55,533 INFO L193 MainTranslator]: Completed translation [2018-10-21 12:24:55,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55 WrapperNode [2018-10-21 12:24:55,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-21 12:24:55,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-21 12:24:55,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-21 12:24:55,535 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-21 12:24:55,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-21 12:24:55,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-21 12:24:55,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-21 12:24:55,575 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-21 12:24:55,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (1/1) ... [2018-10-21 12:24:55,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-21 12:24:55,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-21 12:24:55,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-21 12:24:55,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-21 12:24:55,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (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-21 12:24:55,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-21 12:24:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-21 12:24:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-21 12:24:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-21 12:24:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-21 12:24:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-21 12:24:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-21 12:24:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-21 12:24:56,117 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-21 12:24:56,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:24:56 BoogieIcfgContainer [2018-10-21 12:24:56,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-21 12:24:56,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-21 12:24:56,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-21 12:24:56,124 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-21 12:24:56,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 12:24:55" (1/3) ... [2018-10-21 12:24:56,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128157df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:24:56, skipping insertion in model container [2018-10-21 12:24:56,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:24:55" (2/3) ... [2018-10-21 12:24:56,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128157df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:24:56, skipping insertion in model container [2018-10-21 12:24:56,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:24:56" (3/3) ... [2018-10-21 12:24:56,129 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call_true-termination.i [2018-10-21 12:24:56,138 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-21 12:24:56,146 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-21 12:24:56,164 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-21 12:24:56,199 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-21 12:24:56,200 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-21 12:24:56,200 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-21 12:24:56,200 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-21 12:24:56,200 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-21 12:24:56,200 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-21 12:24:56,200 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-21 12:24:56,201 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-21 12:24:56,201 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-21 12:24:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-21 12:24:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-21 12:24:56,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:56,225 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:24:56,227 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:56,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:56,233 INFO L82 PathProgramCache]: Analyzing trace with hash 296275345, now seen corresponding path program 1 times [2018-10-21 12:24:56,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:56,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:56,281 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:56,381 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-21 12:24:56,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:24:56,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-21 12:24:56,383 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:24:56,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-21 12:24:56,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-21 12:24:56,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-21 12:24:56,403 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-10-21 12:24:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:24:56,424 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-10-21 12:24:56,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-21 12:24:56,426 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-10-21 12:24:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:24:56,435 INFO L225 Difference]: With dead ends: 36 [2018-10-21 12:24:56,435 INFO L226 Difference]: Without dead ends: 16 [2018-10-21 12:24:56,441 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-21 12:24:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-21 12:24:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-21 12:24:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-21 12:24:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-10-21 12:24:56,488 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2018-10-21 12:24:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:24:56,489 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-10-21 12:24:56,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-21 12:24:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-10-21 12:24:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-21 12:24:56,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:56,491 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:24:56,491 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:56,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:56,494 INFO L82 PathProgramCache]: Analyzing trace with hash 665169549, now seen corresponding path program 1 times [2018-10-21 12:24:56,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:56,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:56,501 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:56,831 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-10-21 12:24:56,833 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-21 12:24:56,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:24:56,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-21 12:24:56,834 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:24:56,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-21 12:24:56,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-21 12:24:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:24:56,837 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-10-21 12:24:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:24:56,929 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-10-21 12:24:56,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-21 12:24:56,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-21 12:24:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:24:56,931 INFO L225 Difference]: With dead ends: 26 [2018-10-21 12:24:56,931 INFO L226 Difference]: Without dead ends: 20 [2018-10-21 12:24:56,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:24:56,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-21 12:24:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-10-21 12:24:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-21 12:24:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-10-21 12:24:56,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-10-21 12:24:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:24:56,938 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-10-21 12:24:56,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-21 12:24:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-10-21 12:24:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-21 12:24:56,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:24:56,940 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:24:56,940 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:24:56,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash 361632356, now seen corresponding path program 1 times [2018-10-21 12:24:56,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:24:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:56,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:24:56,942 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:24:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:57,190 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-21 12:24:57,635 WARN L179 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 20 [2018-10-21 12:24:57,977 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 20 [2018-10-21 12:24:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:58,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:58,032 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:24:58,033 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-10-21 12:24:58,035 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [21], [25], [29], [32], [34], [40], [41], [42], [44] [2018-10-21 12:24:58,084 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:24:58,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:24:58,247 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-21 12:24:58,742 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-21 12:24:58,743 INFO L272 AbstractInterpreter]: Visited 16 different actions 19 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-10-21 12:24:58,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:24:58,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-21 12:24:58,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:58,751 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-21 12:24:58,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:58,761 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:24:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:58,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:58,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-21 12:24:58,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-21 12:24:58,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:58,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:58,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:58,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-21 12:24:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:59,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:24:59,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-10-21 12:24:59,151 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:59,153 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:59,154 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 19 [2018-10-21 12:24:59,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-21 12:24:59,238 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:59,251 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:24:59,252 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 15 treesize of output 18 [2018-10-21 12:24:59,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:9 [2018-10-21 12:24:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:59,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:24:59,449 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:24:59,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:24:59,475 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:24:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:24:59,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:24:59,836 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 34 treesize of output 31 [2018-10-21 12:24:59,841 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-21 12:24:59,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2018-10-21 12:24:59,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-21 12:24:59,944 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-21 12:24:59,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:24:59,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-21 12:24:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:24:59,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:25:00,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-10-21 12:25:00,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-21 12:25:00,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-10-21 12:25:00,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-21 12:25:00,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:00,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:15 [2018-10-21 12:25:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:25:00,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:25:00,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 8, 8] total 18 [2018-10-21 12:25:00,614 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:25:00,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-21 12:25:00,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-21 12:25:00,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-10-21 12:25:00,616 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 10 states. [2018-10-21 12:25:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:25:00,805 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-10-21 12:25:00,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-21 12:25:00,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-21 12:25:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:25:00,807 INFO L225 Difference]: With dead ends: 28 [2018-10-21 12:25:00,807 INFO L226 Difference]: Without dead ends: 22 [2018-10-21 12:25:00,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-10-21 12:25:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-21 12:25:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-21 12:25:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-21 12:25:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-10-21 12:25:00,814 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2018-10-21 12:25:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:25:00,814 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-10-21 12:25:00,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-21 12:25:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-10-21 12:25:00,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-21 12:25:00,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:25:00,815 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:25:00,816 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:25:00,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:25:00,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1315091131, now seen corresponding path program 2 times [2018-10-21 12:25:00,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:25:00,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:25:00,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:25:00,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:25:00,818 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:25:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:25:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:25:01,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:25:01,038 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:25:01,038 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:25:01,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:25:01,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:25:01,039 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-21 12:25:01,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-21 12:25:01,048 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:25:01,107 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-21 12:25:01,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:25:01,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:25:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:25:01,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:25:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:25:01,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:25:01,281 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:25:01,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-21 12:25:01,298 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:25:01,377 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-21 12:25:01,377 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:25:01,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:25:01,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-21 12:25:01,472 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-21 12:25:01,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2018-10-21 12:25:01,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-21 12:25:01,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-21 12:25:01,741 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-21 12:25:01,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:01,774 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-21 12:25:01,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2018-10-21 12:25:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-21 12:25:01,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:25:02,068 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-21 12:25:02,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:02,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-10-21 12:25:02,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-21 12:25:02,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:02,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:02,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-10-21 12:25:02,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-21 12:25:02,273 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-21 12:25:02,278 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-21 12:25:02,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-21 12:25:02,295 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:124, output treesize:34 [2018-10-21 12:25:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-21 12:25:02,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:25:02,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 8, 8] total 18 [2018-10-21 12:25:02,446 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:25:02,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-21 12:25:02,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-21 12:25:02,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-10-21 12:25:02,447 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2018-10-21 12:25:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:25:02,485 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-10-21 12:25:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-21 12:25:02,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-10-21 12:25:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:25:02,487 INFO L225 Difference]: With dead ends: 22 [2018-10-21 12:25:02,487 INFO L226 Difference]: Without dead ends: 0 [2018-10-21 12:25:02,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-10-21 12:25:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-21 12:25:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-21 12:25:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-21 12:25:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-21 12:25:02,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-10-21 12:25:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:25:02,489 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-21 12:25:02,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-21 12:25:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-21 12:25:02,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-21 12:25:02,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-21 12:25:02,559 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-21 12:25:02,560 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-21 12:25:02,560 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:25:02,560 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:25:02,560 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-21 12:25:02,560 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-21 12:25:02,560 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-21 12:25:02,560 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 29) the Hoare annotation is: true [2018-10-21 12:25:02,561 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (= 0 |main_~#array~0.offset|) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= main_~menor~0 |main_#t~mem5|)) [2018-10-21 12:25:02,561 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-10-21 12:25:02,561 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 29) no Hoare annotation was computed. [2018-10-21 12:25:02,561 INFO L425 ceAbstractionStarter]: For program point L22(lines 22 23) no Hoare annotation was computed. [2018-10-21 12:25:02,561 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2018-10-21 12:25:02,561 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2018-10-21 12:25:02,561 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 24) the Hoare annotation is: (let ((.cse0 (= main_~SIZE~0 1)) (.cse1 (= 0 |main_~#array~0.offset|))) (or (and .cse0 (<= main_~j~0 1) .cse1 (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= 1 main_~j~0)) (and .cse0 .cse1 (= main_~j~0 0)))) [2018-10-21 12:25:02,561 INFO L425 ceAbstractionStarter]: For program point L19-5(lines 19 24) no Hoare annotation was computed. [2018-10-21 12:25:02,561 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 29) no Hoare annotation was computed. [2018-10-21 12:25:02,562 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-21 12:25:02,562 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-21 12:25:02,562 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-21 12:25:02,562 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-21 12:25:02,562 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-21 12:25:02,562 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-21 12:25:02,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-21 12:25:02,574 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-21 12:25:02,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 12:25:02 BoogieIcfgContainer [2018-10-21 12:25:02,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-21 12:25:02,577 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-21 12:25:02,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-21 12:25:02,577 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-21 12:25:02,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:24:56" (3/4) ... [2018-10-21 12:25:02,581 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-21 12:25:02,586 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-21 12:25:02,586 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-21 12:25:02,586 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-21 12:25:02,591 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-10-21 12:25:02,591 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-10-21 12:25:02,592 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-21 12:25:02,651 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-21 12:25:02,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-21 12:25:02,652 INFO L168 Benchmark]: Toolchain (without parser) took 7404.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 954.5 MB in the beginning and 1.0 GB in the end (delta: -90.4 MB). Peak memory consumption was 127.7 MB. Max. memory is 11.5 GB. [2018-10-21 12:25:02,653 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:25:02,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.21 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 943.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-21 12:25:02,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.58 ms. Allocated memory is still 1.0 GB. Free memory is still 943.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:25:02,655 INFO L168 Benchmark]: Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 938.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-21 12:25:02,655 INFO L168 Benchmark]: RCFGBuilder took 515.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 938.4 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-10-21 12:25:02,656 INFO L168 Benchmark]: TraceAbstraction took 6455.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Peak memory consumption was 139.5 MB. Max. memory is 11.5 GB. [2018-10-21 12:25:02,657 INFO L168 Benchmark]: Witness Printer took 74.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-10-21 12:25:02,661 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.49 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.21 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 943.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.58 ms. Allocated memory is still 1.0 GB. Free memory is still 943.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 938.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 515.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 938.4 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6455.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Peak memory consumption was 139.5 MB. Max. memory is 11.5 GB. * Witness Printer took 74.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2018-10-21 12:25:02,668 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-21 12:25:02,669 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((SIZE == 1 && j <= 1) && 0 == array) && menor <= unknown-#memory_int-unknown[array][array]) && 1 <= j) || ((SIZE == 1 && 0 == array) && j == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 6 SDslu, 90 SDs, 0 SdLazy, 72 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 13 NumberOfFragments, 50 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 203 ConstructedInterpolants, 10 QuantifiedInterpolants, 19373 SizeOfPredicates, 62 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 22/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...