./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i --full-output --rcfgbuilder.size.of.a.code.block LoopFreeBlock --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 --rcfgbuilder.size.of.a.code.block LoopFreeBlock ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-22 10:04:45,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 10:04:45,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 10:04:45,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 10:04:45,099 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 10:04:45,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 10:04:45,102 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 10:04:45,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 10:04:45,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 10:04:45,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 10:04:45,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 10:04:45,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 10:04:45,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 10:04:45,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 10:04:45,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 10:04:45,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 10:04:45,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 10:04:45,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 10:04:45,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 10:04:45,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 10:04:45,123 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 10:04:45,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 10:04:45,128 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 10:04:45,128 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 10:04:45,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 10:04:45,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 10:04:45,131 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 10:04:45,132 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 10:04:45,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 10:04:45,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 10:04:45,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 10:04:45,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 10:04:45,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 10:04:45,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 10:04:45,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 10:04:45,139 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 10:04:45,140 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-22 10:04:45,157 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 10:04:45,158 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 10:04:45,159 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 10:04:45,159 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 10:04:45,159 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 10:04:45,159 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 10:04:45,160 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 10:04:45,161 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 10:04:45,161 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 10:04:45,161 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 10:04:45,161 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 10:04:45,162 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 10:04:45,162 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-22 10:04:45,163 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 10:04:45,164 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-22 10:04:45,164 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 10:04:45,164 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 10:04:45,164 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 10:04:45,164 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 10:04:45,168 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-22 10:04:45,168 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 10:04:45,168 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 10:04:45,169 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 10:04:45,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 10:04:45,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 10:04:45,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 10:04:45,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 10:04:45,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 10:04:45,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 10:04:45,170 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 10:04:45,170 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 10:04:45,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 10:04:45,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 10:04:45,171 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 10:04:45,171 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock [2018-10-22 10:04:45,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 10:04:45,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 10:04:45,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 10:04:45,254 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 10:04:45,255 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 10:04:45,256 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-22 10:04:45,321 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f6f4ff2e4/00198c6888854ab4944d68ced7ab55c0/FLAG22420ab91 [2018-10-22 10:04:45,831 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 10:04:45,831 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i [2018-10-22 10:04:45,838 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f6f4ff2e4/00198c6888854ab4944d68ced7ab55c0/FLAG22420ab91 [2018-10-22 10:04:45,854 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f6f4ff2e4/00198c6888854ab4944d68ced7ab55c0 [2018-10-22 10:04:45,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 10:04:45,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-22 10:04:45,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 10:04:45,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 10:04:45,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 10:04:45,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:04:45" (1/1) ... [2018-10-22 10:04:45,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8662dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:45, skipping insertion in model container [2018-10-22 10:04:45,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:04:45" (1/1) ... [2018-10-22 10:04:45,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 10:04:45,901 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 10:04:46,097 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 10:04:46,102 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 10:04:46,129 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 10:04:46,156 INFO L193 MainTranslator]: Completed translation [2018-10-22 10:04:46,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46 WrapperNode [2018-10-22 10:04:46,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 10:04:46,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 10:04:46,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 10:04:46,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 10:04:46,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (1/1) ... [2018-10-22 10:04:46,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (1/1) ... [2018-10-22 10:04:46,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 10:04:46,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 10:04:46,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 10:04:46,199 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 10:04:46,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (1/1) ... [2018-10-22 10:04:46,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (1/1) ... [2018-10-22 10:04:46,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (1/1) ... [2018-10-22 10:04:46,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (1/1) ... [2018-10-22 10:04:46,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (1/1) ... [2018-10-22 10:04:46,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (1/1) ... [2018-10-22 10:04:46,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (1/1) ... [2018-10-22 10:04:46,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 10:04:46,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 10:04:46,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 10:04:46,226 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 10:04:46,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 10:04:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 10:04:46,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 10:04:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 10:04:46,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 10:04:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 10:04:46,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 10:04:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 10:04:46,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 10:04:46,882 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 10:04:46,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:04:46 BoogieIcfgContainer [2018-10-22 10:04:46,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 10:04:46,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 10:04:46,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 10:04:46,888 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 10:04:46,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 10:04:45" (1/3) ... [2018-10-22 10:04:46,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec4cf4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 10:04:46, skipping insertion in model container [2018-10-22 10:04:46,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:04:46" (2/3) ... [2018-10-22 10:04:46,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec4cf4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 10:04:46, skipping insertion in model container [2018-10-22 10:04:46,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:04:46" (3/3) ... [2018-10-22 10:04:46,891 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call_true-termination.i [2018-10-22 10:04:46,903 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 10:04:46,913 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 10:04:46,928 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 10:04:46,957 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 10:04:46,958 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 10:04:46,958 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 10:04:46,958 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 10:04:46,958 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 10:04:46,959 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 10:04:46,959 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 10:04:46,959 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 10:04:46,959 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 10:04:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-22 10:04:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-22 10:04:46,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:04:46,982 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:04:46,984 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:04:46,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:04:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash 733636146, now seen corresponding path program 1 times [2018-10-22 10:04:46,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:04:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:04:47,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:04:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:04:47,044 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:04:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:04:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:04:47,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 10:04:47,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 10:04:47,147 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:04:47,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 10:04:47,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 10:04:47,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 10:04:47,172 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-10-22 10:04:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:04:47,195 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-10-22 10:04:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 10:04:47,196 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-22 10:04:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:04:47,206 INFO L225 Difference]: With dead ends: 31 [2018-10-22 10:04:47,206 INFO L226 Difference]: Without dead ends: 13 [2018-10-22 10:04:47,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 10:04:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-22 10:04:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-22 10:04:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-22 10:04:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-22 10:04:47,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-22 10:04:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:04:47,254 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-22 10:04:47,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 10:04:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-22 10:04:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-22 10:04:47,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:04:47,256 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:04:47,256 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:04:47,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:04:47,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1338452492, now seen corresponding path program 1 times [2018-10-22 10:04:47,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:04:47,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:04:47,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:04:47,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:04:47,259 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:04:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:04:47,587 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-10-22 10:04:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:04:47,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 10:04:47,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 10:04:47,591 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:04:47,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 10:04:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 10:04:47,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 10:04:47,593 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-10-22 10:04:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:04:47,617 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-22 10:04:47,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 10:04:47,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-22 10:04:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:04:47,619 INFO L225 Difference]: With dead ends: 21 [2018-10-22 10:04:47,619 INFO L226 Difference]: Without dead ends: 15 [2018-10-22 10:04:47,621 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-22 10:04:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-22 10:04:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-22 10:04:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-22 10:04:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-22 10:04:47,626 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-22 10:04:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:04:47,627 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-22 10:04:47,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 10:04:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-22 10:04:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-22 10:04:47,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:04:47,628 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:04:47,629 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:04:47,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:04:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1625276387, now seen corresponding path program 1 times [2018-10-22 10:04:47,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:04:47,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:04:47,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:04:47,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:04:47,631 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:04:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:04:48,012 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-10-22 10:04:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:04:48,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:04:48,113 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:04:48,114 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-10-22 10:04:48,116 INFO L202 CegarAbsIntRunner]: [5], [9], [12], [25], [29], [32], [34], [40], [41], [42], [44], [46], [50] [2018-10-22 10:04:48,173 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:04:48,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:04:48,355 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-22 10:04:51,853 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 10:04:51,855 INFO L272 AbstractInterpreter]: Visited 13 different actions 192 times. Merged at 4 different actions 90 times. Widened at 1 different actions 19 times. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-10-22 10:04:51,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:04:51,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 10:04:51,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:04:51,902 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 10:04:51,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:04:51,924 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 10:04:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:04:51,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 10:04:52,182 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-22 10:04:52,198 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-22 10:04:52,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:52,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:52,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:52,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-22 10:04:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:04:52,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 10:04:52,568 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 34 treesize of output 30 [2018-10-22 10:04:52,574 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:52,578 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:52,579 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-22 10:04:52,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:52,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:52,902 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 34 treesize of output 30 [2018-10-22 10:04:52,928 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:52,941 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:52,943 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-22 10:04:52,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:53,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:53,296 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 34 treesize of output 30 [2018-10-22 10:04:53,306 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,308 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-22 10:04:53,309 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:53,320 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:53,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-10-22 10:04:53,749 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,750 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,750 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,752 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,753 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 52 [2018-10-22 10:04:53,756 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:53,768 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:53,843 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 34 treesize of output 30 [2018-10-22 10:04:53,847 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,848 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,849 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-22 10:04:53,851 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:53,861 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:53,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-10-22 10:04:53,939 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,939 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,940 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,943 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,944 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:53,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 52 [2018-10-22 10:04:53,947 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,008 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-10-22 10:04:54,068 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 18 variables, input treesize:244, output treesize:115 [2018-10-22 10:04:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:04:54,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:04:54,266 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 10:04:54,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:04:54,286 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 10:04:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:04:54,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 10:04:54,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-10-22 10:04:54,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-22 10:04:54,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-10-22 10:04:54,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-22 10:04:54,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,527 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-22 10:04:54,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:29 [2018-10-22 10:04:54,622 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-22 10:04:54,626 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-22 10:04:54,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-22 10:04:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:04:54,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 10:04:54,755 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-22 10:04:54,820 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 7 treesize of output 5 [2018-10-22 10:04:54,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:54,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-10-22 10:04:55,013 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:55,014 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:55,016 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 21 [2018-10-22 10:04:55,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:55,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:55,124 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-22 10:04:55,157 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 7 treesize of output 5 [2018-10-22 10:04:55,158 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:55,282 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:55,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-10-22 10:04:55,477 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 7 treesize of output 5 [2018-10-22 10:04:55,478 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:55,488 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:55,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-10-22 10:04:55,619 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 7 treesize of output 5 [2018-10-22 10:04:55,620 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:55,628 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:55,724 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 59 treesize of output 55 [2018-10-22 10:04:55,761 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:55,762 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 10:04:55,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-10-22 10:04:55,765 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-22 10:04:55,897 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 10:04:55,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-22 10:04:55,963 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:265, output treesize:34 [2018-10-22 10:04:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:04:56,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 10:04:56,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 8, 7] total 15 [2018-10-22 10:04:56,020 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 10:04:56,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-22 10:04:56,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-22 10:04:56,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-10-22 10:04:56,022 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-22 10:04:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:04:56,122 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-22 10:04:56,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-22 10:04:56,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-22 10:04:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:04:56,123 INFO L225 Difference]: With dead ends: 15 [2018-10-22 10:04:56,123 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 10:04:56,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-10-22 10:04:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 10:04:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 10:04:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 10:04:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 10:04:56,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-10-22 10:04:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:04:56,126 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 10:04:56,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-22 10:04:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 10:04:56,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 10:04:56,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 10:04:56,218 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-22 10:04:56,219 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-22 10:04:56,219 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 10:04:56,219 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 10:04:56,219 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 10:04:56,219 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 10:04:56,220 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 10:04:56,220 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 29) the Hoare annotation is: true [2018-10-22 10:04:56,220 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (= main_~SIZE~0 1) (= 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-22 10:04:56,220 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-10-22 10:04:56,220 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 29) no Hoare annotation was computed. [2018-10-22 10:04:56,221 INFO L425 ceAbstractionStarter]: For program point L22(lines 22 23) no Hoare annotation was computed. [2018-10-22 10:04:56,221 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2018-10-22 10:04:56,221 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2018-10-22 10:04:56,221 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|)) (.cse2 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (or (and .cse0 .cse1 (< main_~menor~0 .cse2)) (and .cse0 .cse1 (= main_~j~0 0)) (and .cse0 .cse1 (= main_~menor~0 .cse2)))) [2018-10-22 10:04:56,221 INFO L425 ceAbstractionStarter]: For program point L19-5(lines 19 24) no Hoare annotation was computed. [2018-10-22 10:04:56,221 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 29) no Hoare annotation was computed. [2018-10-22 10:04:56,221 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-22 10:04:56,221 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-22 10:04:56,222 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-22 10:04:56,222 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-22 10:04:56,222 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-22 10:04:56,222 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-22 10:04:56,228 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 10:04:56,229 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 10:04:56,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 10:04:56,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 10:04:56,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 10:04:56 BoogieIcfgContainer [2018-10-22 10:04:56,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 10:04:56,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-22 10:04:56,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-22 10:04:56,242 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-22 10:04:56,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:04:46" (3/4) ... [2018-10-22 10:04:56,248 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-22 10:04:56,253 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-22 10:04:56,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-22 10:04:56,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-22 10:04:56,259 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-10-22 10:04:56,259 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-10-22 10:04:56,260 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-10-22 10:04:56,260 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-22 10:04:56,338 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-22 10:04:56,338 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-22 10:04:56,343 INFO L168 Benchmark]: Toolchain (without parser) took 10484.23 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 600.3 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 464.6 MB. Max. memory is 11.5 GB. [2018-10-22 10:04:56,344 INFO L168 Benchmark]: CDTParser took 0.25 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-22 10:04:56,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.23 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-22 10:04:56,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.72 ms. Allocated memory is still 1.0 GB. Free memory is still 942.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:04:56,350 INFO L168 Benchmark]: Boogie Preprocessor took 25.80 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-22 10:04:56,350 INFO L168 Benchmark]: RCFGBuilder took 657.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-10-22 10:04:56,351 INFO L168 Benchmark]: TraceAbstraction took 9356.87 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 476.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.0 MB). Peak memory consumption was 477.6 MB. Max. memory is 11.5 GB. [2018-10-22 10:04:56,351 INFO L168 Benchmark]: Witness Printer took 96.80 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:04:56,354 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.25 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 296.23 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.4 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 40.72 ms. Allocated memory is still 1.0 GB. Free memory is still 942.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.80 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 657.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9356.87 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 476.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.0 MB). Peak memory consumption was 477.6 MB. Max. memory is 11.5 GB. * Witness Printer took 96.80 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. 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 - 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-22 10:04:56,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 10:04:56,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 10:04:56,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-22 10:04:56,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((SIZE == 1 && 0 == array) && menor < unknown-#memory_int-unknown[array][array]) || ((SIZE == 1 && 0 == array) && j == 0)) || ((SIZE == 1 && 0 == array) && menor == unknown-#memory_int-unknown[array][array]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 9.2s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 4 SDslu, 48 SDs, 0 SdLazy, 30 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 61 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 86 ConstructedInterpolants, 2 QuantifiedInterpolants, 5332 SizeOfPredicates, 43 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 0/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...