./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8538ad1ae962a1ba831f755fb5c2de9d27f82db5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 17:29:21,977 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 17:29:21,979 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 17:29:21,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 17:29:21,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 17:29:21,994 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 17:29:21,995 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 17:29:21,997 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 17:29:21,998 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 17:29:21,999 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 17:29:22,001 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 17:29:22,001 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 17:29:22,002 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 17:29:22,003 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 17:29:22,004 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 17:29:22,005 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 17:29:22,006 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 17:29:22,008 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 17:29:22,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 17:29:22,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 17:29:22,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 17:29:22,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 17:29:22,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 17:29:22,017 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 17:29:22,017 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 17:29:22,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 17:29:22,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 17:29:22,020 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 17:29:22,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 17:29:22,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 17:29:22,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 17:29:22,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 17:29:22,023 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 17:29:22,024 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 17:29:22,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 17:29:22,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 17:29:22,026 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 17:29:22,041 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 17:29:22,041 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 17:29:22,042 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 17:29:22,043 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 17:29:22,043 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 17:29:22,043 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 17:29:22,043 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 17:29:22,043 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 17:29:22,044 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 17:29:22,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 17:29:22,045 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 17:29:22,045 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 17:29:22,045 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 17:29:22,045 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 17:29:22,045 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 17:29:22,045 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 17:29:22,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 17:29:22,046 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 17:29:22,046 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 17:29:22,046 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 17:29:22,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 17:29:22,047 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 17:29:22,047 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 17:29:22,047 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 17:29:22,047 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 17:29:22,047 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 17:29:22,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 17:29:22,048 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/UAutomizer-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 -> Automizer 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 -> 8538ad1ae962a1ba831f755fb5c2de9d27f82db5 [2019-01-14 17:29:22,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 17:29:22,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 17:29:22,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 17:29:22,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 17:29:22,104 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 17:29:22,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2019-01-14 17:29:22,160 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597de7290/c34ff8447e8841d6ae29badab0e7229c/FLAG050bda9da [2019-01-14 17:29:22,572 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 17:29:22,573 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2019-01-14 17:29:22,579 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597de7290/c34ff8447e8841d6ae29badab0e7229c/FLAG050bda9da [2019-01-14 17:29:22,952 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597de7290/c34ff8447e8841d6ae29badab0e7229c [2019-01-14 17:29:22,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 17:29:22,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 17:29:22,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 17:29:22,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 17:29:22,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 17:29:22,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:29:22" (1/1) ... [2019-01-14 17:29:22,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a621260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:22, skipping insertion in model container [2019-01-14 17:29:22,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:29:22" (1/1) ... [2019-01-14 17:29:22,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 17:29:22,992 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 17:29:23,181 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:29:23,185 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 17:29:23,208 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:29:23,233 INFO L195 MainTranslator]: Completed translation [2019-01-14 17:29:23,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23 WrapperNode [2019-01-14 17:29:23,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 17:29:23,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 17:29:23,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 17:29:23,236 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 17:29:23,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (1/1) ... [2019-01-14 17:29:23,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (1/1) ... [2019-01-14 17:29:23,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 17:29:23,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 17:29:23,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 17:29:23,290 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 17:29:23,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (1/1) ... [2019-01-14 17:29:23,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (1/1) ... [2019-01-14 17:29:23,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (1/1) ... [2019-01-14 17:29:23,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (1/1) ... [2019-01-14 17:29:23,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (1/1) ... [2019-01-14 17:29:23,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (1/1) ... [2019-01-14 17:29:23,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (1/1) ... [2019-01-14 17:29:23,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 17:29:23,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 17:29:23,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 17:29:23,394 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 17:29:23,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 17:29:23,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 17:29:23,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 17:29:23,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 17:29:23,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 17:29:23,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 17:29:23,906 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 17:29:23,906 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-14 17:29:23,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:29:23 BoogieIcfgContainer [2019-01-14 17:29:23,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 17:29:23,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 17:29:23,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 17:29:23,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 17:29:23,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 05:29:22" (1/3) ... [2019-01-14 17:29:23,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271cae85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:29:23, skipping insertion in model container [2019-01-14 17:29:23,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:29:23" (2/3) ... [2019-01-14 17:29:23,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271cae85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:29:23, skipping insertion in model container [2019-01-14 17:29:23,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:29:23" (3/3) ... [2019-01-14 17:29:23,915 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4_true-termination.i [2019-01-14 17:29:23,924 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 17:29:23,931 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-14 17:29:23,947 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-14 17:29:23,976 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 17:29:23,977 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 17:29:23,977 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 17:29:23,977 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 17:29:23,977 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 17:29:23,978 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 17:29:23,978 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 17:29:23,978 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 17:29:23,978 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 17:29:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-14 17:29:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 17:29:23,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:29:23,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 17:29:24,001 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:29:24,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:29:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash 28699754, now seen corresponding path program 1 times [2019-01-14 17:29:24,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:29:24,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:29:24,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:29:24,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:29:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:29:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:29:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:29:24,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:29:24,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:29:24,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:29:24,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:29:24,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:29:24,222 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 4 states. [2019-01-14 17:29:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:29:24,417 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2019-01-14 17:29:24,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:29:24,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-14 17:29:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:29:24,427 INFO L225 Difference]: With dead ends: 45 [2019-01-14 17:29:24,427 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 17:29:24,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:29:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 17:29:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2019-01-14 17:29:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 17:29:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-14 17:29:24,461 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 5 [2019-01-14 17:29:24,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:29:24,461 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 17:29:24,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:29:24,462 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-01-14 17:29:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 17:29:24,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:29:24,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:29:24,463 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:29:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:29:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1809251313, now seen corresponding path program 1 times [2019-01-14 17:29:24,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:29:24,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:29:24,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:29:24,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:29:24,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:29:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:29:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:29:24,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:29:24,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:29:24,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:29:24,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:29:24,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:29:24,522 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 3 states. [2019-01-14 17:29:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:29:24,562 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-01-14 17:29:24,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:29:24,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-14 17:29:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:29:24,564 INFO L225 Difference]: With dead ends: 22 [2019-01-14 17:29:24,564 INFO L226 Difference]: Without dead ends: 16 [2019-01-14 17:29:24,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:29:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-14 17:29:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-14 17:29:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 17:29:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-14 17:29:24,574 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 7 [2019-01-14 17:29:24,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:29:24,575 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-14 17:29:24,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:29:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-14 17:29:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 17:29:24,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:29:24,576 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 17:29:24,577 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:29:24,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:29:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash 300686882, now seen corresponding path program 1 times [2019-01-14 17:29:24,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:29:24,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:29:24,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:29:24,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:29:24,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:29:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:29:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:29:24,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:29:24,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 17:29:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:29:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:29:25,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:29:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:29:25,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:29:25,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-14 17:29:25,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:29:25,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:29:25,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:29:25,289 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-14 17:29:25,616 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-01-14 17:29:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:29:25,829 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-01-14 17:29:25,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 17:29:25,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-14 17:29:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:29:25,831 INFO L225 Difference]: With dead ends: 26 [2019-01-14 17:29:25,831 INFO L226 Difference]: Without dead ends: 24 [2019-01-14 17:29:25,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-14 17:29:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-14 17:29:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 12. [2019-01-14 17:29:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 17:29:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-14 17:29:25,839 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2019-01-14 17:29:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:29:25,839 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 17:29:25,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:29:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-14 17:29:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 17:29:25,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:29:25,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:29:25,841 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:29:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:29:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1195876265, now seen corresponding path program 1 times [2019-01-14 17:29:25,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:29:25,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:29:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:29:25,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:29:25,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:29:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:29:26,878 WARN L181 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 73 [2019-01-14 17:29:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:29:26,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:29:26,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:29:26,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:29:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:29:27,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:29:27,435 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 29 [2019-01-14 17:29:29,865 WARN L181 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 17:29:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:29:30,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 17:29:30,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-01-14 17:29:30,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 17:29:30,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 17:29:30,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-14 17:29:30,279 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 11 states. [2019-01-14 17:29:31,160 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-01-14 17:29:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:29:31,898 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-01-14 17:29:31,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:29:31,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-01-14 17:29:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:29:31,899 INFO L225 Difference]: With dead ends: 18 [2019-01-14 17:29:31,899 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 17:29:31,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-14 17:29:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 17:29:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 17:29:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 17:29:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 17:29:31,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-14 17:29:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:29:31,901 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 17:29:31,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 17:29:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 17:29:31,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 17:29:31,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 17:29:32,273 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-01-14 17:29:32,451 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-14 17:29:32,665 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-01-14 17:29:32,735 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-01-14 17:29:32,735 INFO L444 ceAbstractionStarter]: At program point L31-2(lines 31 37) the Hoare annotation is: (let ((.cse2 (= 0 |ULTIMATE.start_main_~#array~0.offset|))) (or (let ((.cse0 (mod (+ ULTIMATE.start_main_~index1~0 4294967295) 4294967296)) (.cse1 (mod (+ ULTIMATE.start_main_~index2~0 1) 4294967296))) (and (< .cse0 .cse1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse2 (let ((.cse3 (select |#memory_int| |ULTIMATE.start_main_~#array~0.base|))) (= (mod (select .cse3 (+ |ULTIMATE.start_main_~#array~0.offset| (* 4 .cse1))) 4294967296) (mod (select .cse3 (+ (* 4 .cse0) |ULTIMATE.start_main_~#array~0.offset|)) 4294967296))) (< .cse1 100000))) (and .cse2 (< (mod ULTIMATE.start_main_~index1~0 4294967296) 100000) (= ULTIMATE.start_main_~loop_entered~0 0) (<= ULTIMATE.start_main_~index2~0 (+ (* 4294967296 (div ULTIMATE.start_main_~index2~0 4294967296)) 99999))))) [2019-01-14 17:29:32,736 INFO L448 ceAbstractionStarter]: For program point L31-3(lines 20 47) no Hoare annotation was computed. [2019-01-14 17:29:32,736 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 47) no Hoare annotation was computed. [2019-01-14 17:29:32,736 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2019-01-14 17:29:32,736 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 9 15) the Hoare annotation is: (let ((.cse0 (mod ULTIMATE.start_main_~index2~0 4294967296))) (and (< .cse0 100000) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= 0 |ULTIMATE.start_main_~#array~0.offset|) (< (mod ULTIMATE.start_main_~index1~0 4294967296) .cse0))) [2019-01-14 17:29:32,736 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 13) no Hoare annotation was computed. [2019-01-14 17:29:32,737 INFO L444 ceAbstractionStarter]: At program point L11-5(lines 9 15) the Hoare annotation is: (let ((.cse0 (mod (+ ULTIMATE.start_main_~index1~0 4294967295) 4294967296)) (.cse1 (mod (+ ULTIMATE.start_main_~index2~0 1) 4294967296))) (and (< .cse0 .cse1) (<= (mod ULTIMATE.start_main_~index2~0 4294967296) (mod ULTIMATE.start_main_~index1~0 4294967296)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= 0 |ULTIMATE.start_main_~#array~0.offset|) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~#array~0.base|))) (= (mod (select .cse2 (+ |ULTIMATE.start_main_~#array~0.offset| (* 4 .cse1))) 4294967296) (mod (select .cse2 (+ (* 4 .cse0) |ULTIMATE.start_main_~#array~0.offset|)) 4294967296))) (< .cse1 100000))) [2019-01-14 17:29:32,737 INFO L444 ceAbstractionStarter]: At program point L40-2(lines 40 44) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (= 0 |ULTIMATE.start_main_~#array~0.offset|))) (or (let ((.cse0 (mod (+ ULTIMATE.start_main_~index1~0 4294967295) 4294967296)) (.cse1 (mod (+ ULTIMATE.start_main_~index2~0 1) 4294967296))) (and (< .cse0 .cse1) .cse2 .cse3 (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~#array~0.base|))) (= (mod (select .cse4 (+ |ULTIMATE.start_main_~#array~0.offset| (* 4 .cse1))) 4294967296) (mod (select .cse4 (+ (* 4 .cse0) |ULTIMATE.start_main_~#array~0.offset|)) 4294967296))) (< .cse1 100000))) (let ((.cse5 (mod ULTIMATE.start_main_~index2~0 4294967296))) (and (< .cse5 100000) .cse2 .cse3 (< (mod ULTIMATE.start_main_~index1~0 4294967296) .cse5))))) [2019-01-14 17:29:32,737 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 17:29:32,737 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 17:29:32,737 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 17:29:32,737 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2019-01-14 17:29:32,738 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2019-01-14 17:29:32,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 17:29:32,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-01-14 17:29:32,741 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2019-01-14 17:29:32,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,760 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,761 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 05:29:32 BoogieIcfgContainer [2019-01-14 17:29:32,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 17:29:32,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 17:29:32,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 17:29:32,768 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 17:29:32,770 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:29:23" (3/4) ... [2019-01-14 17:29:32,774 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 17:29:32,785 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-14 17:29:32,785 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 17:29:32,785 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 17:29:32,864 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 17:29:32,864 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 17:29:32,865 INFO L168 Benchmark]: Toolchain (without parser) took 9908.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 952.7 MB in the beginning and 863.6 MB in the end (delta: 89.1 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. [2019-01-14 17:29:32,866 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:29:32,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.43 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:29:32,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.07 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:29:32,868 INFO L168 Benchmark]: Boogie Preprocessor took 103.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-14 17:29:32,868 INFO L168 Benchmark]: RCFGBuilder took 514.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-01-14 17:29:32,869 INFO L168 Benchmark]: TraceAbstraction took 8859.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 870.3 MB in the end (delta: 213.9 MB). Peak memory consumption was 213.9 MB. Max. memory is 11.5 GB. [2019-01-14 17:29:32,870 INFO L168 Benchmark]: Witness Printer took 96.23 ms. Allocated memory is still 1.1 GB. Free memory was 870.3 MB in the beginning and 863.6 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 17:29:32,874 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.43 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 54.07 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 514.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8859.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 870.3 MB in the end (delta: 213.9 MB). Peak memory consumption was 213.9 MB. Max. memory is 11.5 GB. * Witness Printer took 96.23 ms. Allocated memory is still 1.1 GB. Free memory was 870.3 MB in the beginning and 863.6 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 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 - 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 - 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 - 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: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2019-01-14 17:29:32,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296 && index2 % 4294967296 <= index1 % 4294967296) && 1 == cond) && 0 == array) && unknown-#memory_int-unknown[array][array + 4 * ((index2 + 1) % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) && (index2 + 1) % 4294967296 < 100000 - InvariantResult [Line: 40]: Loop Invariant [2019-01-14 17:29:32,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296 && 1 == cond) && 0 == array) && unknown-#memory_int-unknown[array][array + 4 * ((index2 + 1) % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) && (index2 + 1) % 4294967296 < 100000) || (((index2 % 4294967296 < 100000 && 1 == cond) && 0 == array) && index1 % 4294967296 < index2 % 4294967296) - InvariantResult [Line: 31]: Loop Invariant [2019-01-14 17:29:32,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 17:29:32,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296 && 1 == cond) && 0 == array) && unknown-#memory_int-unknown[array][array + 4 * ((index2 + 1) % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) && (index2 + 1) % 4294967296 < 100000) || (((0 == array && index1 % 4294967296 < 100000) && loop_entered == 0) && index2 <= 4294967296 * (index2 / 4294967296) + 99999) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: ((index2 % 4294967296 < 100000 && 1 == cond) && 0 == array) && index1 % 4294967296 < index2 % 4294967296 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 2 error locations. SAFE Result, 8.7s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 59 SDslu, 66 SDs, 0 SdLazy, 95 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 236 HoareAnnotationTreeSize, 4 FomulaSimplifications, 509 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 294 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 13464 SizeOfPredicates, 15 NumberOfNonLiveVariables, 94 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 2/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...