./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/array_1-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/loop-acceleration/array_1-2.c -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 dc18d6791d5a51f5782a845009bfa8a1645f2712 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:12:52,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:12:52,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:12:52,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:12:52,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:12:52,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:12:52,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:12:52,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:12:52,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:12:52,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:12:52,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:12:52,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:12:52,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:12:52,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:12:52,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:12:52,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:12:52,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:12:52,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:12:52,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:12:52,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:12:52,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:12:52,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:12:52,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:12:52,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:12:52,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:12:52,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:12:52,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:12:52,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:12:52,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:12:52,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:12:52,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:12:52,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:12:52,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:12:52,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:12:52,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:12:52,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:12:52,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:12:52,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:12:52,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:12:52,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:12:52,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:12:52,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:12:52,591 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:12:52,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:12:52,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:12:52,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:12:52,594 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:12:52,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:12:52,594 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:12:52,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:12:52,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:12:52,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:12:52,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:12:52,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:12:52,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:12:52,596 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:12:52,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:12:52,597 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:12:52,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:12:52,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:12:52,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:12:52,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:12:52,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:12:52,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:12:52,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:12:52,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:12:52,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:12:52,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:12:52,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:12:52,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:12:52,601 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:12:52,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> dc18d6791d5a51f5782a845009bfa8a1645f2712 [2020-07-28 18:12:52,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:12:52,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:12:52,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:12:52,933 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:12:52,934 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:12:52,934 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/array_1-2.c [2020-07-28 18:12:52,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2f193e7/7e81436a98cd47b186e1aebca57f6990/FLAGc79bd7473 [2020-07-28 18:12:53,432 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:12:53,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_1-2.c [2020-07-28 18:12:53,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2f193e7/7e81436a98cd47b186e1aebca57f6990/FLAGc79bd7473 [2020-07-28 18:12:53,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2f193e7/7e81436a98cd47b186e1aebca57f6990 [2020-07-28 18:12:53,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:12:53,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:12:53,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:53,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:12:53,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:12:53,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:53" (1/1) ... [2020-07-28 18:12:53,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f5f43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:53, skipping insertion in model container [2020-07-28 18:12:53,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:53" (1/1) ... [2020-07-28 18:12:53,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:12:53,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:12:54,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:54,065 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:12:54,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:54,107 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:12:54,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54 WrapperNode [2020-07-28 18:12:54,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:54,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:54,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:12:54,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:12:54,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (1/1) ... [2020-07-28 18:12:54,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (1/1) ... [2020-07-28 18:12:54,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:54,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:12:54,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:12:54,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:12:54,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (1/1) ... [2020-07-28 18:12:54,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (1/1) ... [2020-07-28 18:12:54,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (1/1) ... [2020-07-28 18:12:54,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (1/1) ... [2020-07-28 18:12:54,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (1/1) ... [2020-07-28 18:12:54,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (1/1) ... [2020-07-28 18:12:54,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (1/1) ... [2020-07-28 18:12:54,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:12:54,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:12:54,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:12:54,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:12:54,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (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 [2020-07-28 18:12:54,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 18:12:54,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:12:54,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:12:54,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 18:12:54,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 18:12:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 18:12:54,621 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:12:54,622 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:12:54,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:54 BoogieIcfgContainer [2020-07-28 18:12:54,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:12:54,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:12:54,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:12:54,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:12:54,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:12:53" (1/3) ... [2020-07-28 18:12:54,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5621605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:54, skipping insertion in model container [2020-07-28 18:12:54,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:54" (2/3) ... [2020-07-28 18:12:54,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5621605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:54, skipping insertion in model container [2020-07-28 18:12:54,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:54" (3/3) ... [2020-07-28 18:12:54,641 INFO L109 eAbstractionObserver]: Analyzing ICFG array_1-2.c [2020-07-28 18:12:54,651 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:12:54,659 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:12:54,674 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:12:54,697 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:12:54,698 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:12:54,698 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:12:54,698 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:12:54,698 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:12:54,698 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:12:54,699 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:12:54,699 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:12:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-28 18:12:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 18:12:54,721 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:54,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 18:12:54,723 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:54,730 INFO L82 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2020-07-28 18:12:54,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:54,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643000003] [2020-07-28 18:12:54,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:54,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {15#true} is VALID [2020-07-28 18:12:54,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} havoc main_#res;havoc main_#t~post0, main_#t~mem1, main_~#A~0.base, main_~#A~0.offset, main_~i~0;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0;main_~i~0 := 0; {17#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:54,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {17#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 < 1024); {16#false} is VALID [2020-07-28 18:12:54,947 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} call main_#t~mem1 := read~int(main_~#A~0.base, 4092 + main_~#A~0.offset, 4);__VERIFIER_assert_#in~cond := (if 1023 == main_#t~mem1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2020-07-28 18:12:54,947 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 18:12:54,947 INFO L280 TraceCheckUtils]: 5: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 18:12:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:54,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643000003] [2020-07-28 18:12:54,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:54,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:12:54,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849206105] [2020-07-28 18:12:54,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-28 18:12:54,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:54,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:12:55,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:55,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:12:55,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:55,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:12:55,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:12:55,013 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-07-28 18:12:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:55,081 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-28 18:12:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:12:55,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-28 18:12:55,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:12:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-28 18:12:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:12:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-28 18:12:55,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2020-07-28 18:12:55,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:55,150 INFO L225 Difference]: With dead ends: 22 [2020-07-28 18:12:55,150 INFO L226 Difference]: Without dead ends: 10 [2020-07-28 18:12:55,153 INFO L675 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 [2020-07-28 18:12:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-28 18:12:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-07-28 18:12:55,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:55,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 9 states. [2020-07-28 18:12:55,185 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 9 states. [2020-07-28 18:12:55,185 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 9 states. [2020-07-28 18:12:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:55,187 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2020-07-28 18:12:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 18:12:55,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:55,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:55,189 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states. [2020-07-28 18:12:55,189 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states. [2020-07-28 18:12:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:55,192 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2020-07-28 18:12:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 18:12:55,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:55,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:55,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:55,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:12:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-07-28 18:12:55,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2020-07-28 18:12:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:55,197 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-07-28 18:12:55,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:12:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:12:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:12:55,197 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:55,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:55,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:12:55,198 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:55,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:55,198 INFO L82 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2020-07-28 18:12:55,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:55,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46076660] [2020-07-28 18:12:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:55,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {77#true} is VALID [2020-07-28 18:12:55,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} havoc main_#res;havoc main_#t~post0, main_#t~mem1, main_~#A~0.base, main_~#A~0.offset, main_~i~0;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0;main_~i~0 := 0; {79#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:55,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {79#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:55,264 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {80#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:55,265 INFO L280 TraceCheckUtils]: 4: Hoare triple {80#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < 1024); {78#false} is VALID [2020-07-28 18:12:55,266 INFO L280 TraceCheckUtils]: 5: Hoare triple {78#false} call main_#t~mem1 := read~int(main_~#A~0.base, 4092 + main_~#A~0.offset, 4);__VERIFIER_assert_#in~cond := (if 1023 == main_#t~mem1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {78#false} is VALID [2020-07-28 18:12:55,266 INFO L280 TraceCheckUtils]: 6: Hoare triple {78#false} assume 0 == __VERIFIER_assert_~cond; {78#false} is VALID [2020-07-28 18:12:55,266 INFO L280 TraceCheckUtils]: 7: Hoare triple {78#false} assume !false; {78#false} is VALID [2020-07-28 18:12:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:55,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46076660] [2020-07-28 18:12:55,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000772938] [2020-07-28 18:12:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:55,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 18:12:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:55,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:55,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {77#true} is VALID [2020-07-28 18:12:55,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} havoc main_#res;havoc main_#t~post0, main_#t~mem1, main_~#A~0.base, main_~#A~0.offset, main_~i~0;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0;main_~i~0 := 0; {87#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:12:55,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {87#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {87#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:12:55,500 INFO L280 TraceCheckUtils]: 3: Hoare triple {87#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {80#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:55,501 INFO L280 TraceCheckUtils]: 4: Hoare triple {80#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < 1024); {78#false} is VALID [2020-07-28 18:12:55,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {78#false} call main_#t~mem1 := read~int(main_~#A~0.base, 4092 + main_~#A~0.offset, 4);__VERIFIER_assert_#in~cond := (if 1023 == main_#t~mem1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {78#false} is VALID [2020-07-28 18:12:55,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {78#false} assume 0 == __VERIFIER_assert_~cond; {78#false} is VALID [2020-07-28 18:12:55,502 INFO L280 TraceCheckUtils]: 7: Hoare triple {78#false} assume !false; {78#false} is VALID [2020-07-28 18:12:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:55,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:55,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-28 18:12:55,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279876927] [2020-07-28 18:12:55,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-28 18:12:55,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:55,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:12:55,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:55,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:12:55,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:55,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:12:55,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:55,528 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2020-07-28 18:12:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:55,607 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 18:12:55,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:12:55,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-28 18:12:55,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-28 18:12:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-28 18:12:55,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2020-07-28 18:12:55,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:55,641 INFO L225 Difference]: With dead ends: 16 [2020-07-28 18:12:55,641 INFO L226 Difference]: Without dead ends: 12 [2020-07-28 18:12:55,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-28 18:12:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-28 18:12:55,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:55,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 11 states. [2020-07-28 18:12:55,650 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 11 states. [2020-07-28 18:12:55,650 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 11 states. [2020-07-28 18:12:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:55,652 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 18:12:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 18:12:55,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:55,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:55,653 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states. [2020-07-28 18:12:55,653 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states. [2020-07-28 18:12:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:55,655 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 18:12:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 18:12:55,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:55,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:55,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:55,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:12:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-07-28 18:12:55,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2020-07-28 18:12:55,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:55,658 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-07-28 18:12:55,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:12:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:12:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:12:55,659 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:55,660 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:55,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-28 18:12:55,872 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1489078833, now seen corresponding path program 2 times [2020-07-28 18:12:55,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:55,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476641164] [2020-07-28 18:12:55,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:55,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {162#true} is VALID [2020-07-28 18:12:55,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {162#true} havoc main_#res;havoc main_#t~post0, main_#t~mem1, main_~#A~0.base, main_~#A~0.offset, main_~i~0;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0;main_~i~0 := 0; {164#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:55,971 INFO L280 TraceCheckUtils]: 2: Hoare triple {164#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {164#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:55,972 INFO L280 TraceCheckUtils]: 3: Hoare triple {164#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {165#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:55,974 INFO L280 TraceCheckUtils]: 4: Hoare triple {165#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {165#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:55,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {165#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {166#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:55,976 INFO L280 TraceCheckUtils]: 6: Hoare triple {166#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < 1024); {163#false} is VALID [2020-07-28 18:12:55,977 INFO L280 TraceCheckUtils]: 7: Hoare triple {163#false} call main_#t~mem1 := read~int(main_~#A~0.base, 4092 + main_~#A~0.offset, 4);__VERIFIER_assert_#in~cond := (if 1023 == main_#t~mem1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {163#false} is VALID [2020-07-28 18:12:55,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {163#false} assume 0 == __VERIFIER_assert_~cond; {163#false} is VALID [2020-07-28 18:12:55,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {163#false} assume !false; {163#false} is VALID [2020-07-28 18:12:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:55,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476641164] [2020-07-28 18:12:55,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805116654] [2020-07-28 18:12:55,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:56,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:12:56,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:56,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:12:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:56,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:56,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {162#true} is VALID [2020-07-28 18:12:56,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {162#true} havoc main_#res;havoc main_#t~post0, main_#t~mem1, main_~#A~0.base, main_~#A~0.offset, main_~i~0;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0;main_~i~0 := 0; {173#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:12:56,153 INFO L280 TraceCheckUtils]: 2: Hoare triple {173#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {173#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:12:56,154 INFO L280 TraceCheckUtils]: 3: Hoare triple {173#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {165#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:56,155 INFO L280 TraceCheckUtils]: 4: Hoare triple {165#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {165#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:56,156 INFO L280 TraceCheckUtils]: 5: Hoare triple {165#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {166#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:56,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {166#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < 1024); {163#false} is VALID [2020-07-28 18:12:56,158 INFO L280 TraceCheckUtils]: 7: Hoare triple {163#false} call main_#t~mem1 := read~int(main_~#A~0.base, 4092 + main_~#A~0.offset, 4);__VERIFIER_assert_#in~cond := (if 1023 == main_#t~mem1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {163#false} is VALID [2020-07-28 18:12:56,158 INFO L280 TraceCheckUtils]: 8: Hoare triple {163#false} assume 0 == __VERIFIER_assert_~cond; {163#false} is VALID [2020-07-28 18:12:56,159 INFO L280 TraceCheckUtils]: 9: Hoare triple {163#false} assume !false; {163#false} is VALID [2020-07-28 18:12:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:56,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:56,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-28 18:12:56,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762781955] [2020-07-28 18:12:56,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-28 18:12:56,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:56,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:12:56,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:56,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:12:56,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:12:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:12:56,181 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2020-07-28 18:12:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:56,235 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-28 18:12:56,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:12:56,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-28 18:12:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-28 18:12:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-28 18:12:56,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2020-07-28 18:12:56,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:56,265 INFO L225 Difference]: With dead ends: 18 [2020-07-28 18:12:56,265 INFO L226 Difference]: Without dead ends: 14 [2020-07-28 18:12:56,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:12:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-28 18:12:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-07-28 18:12:56,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:56,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2020-07-28 18:12:56,273 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2020-07-28 18:12:56,273 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2020-07-28 18:12:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:56,275 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-28 18:12:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-28 18:12:56,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:56,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:56,276 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2020-07-28 18:12:56,277 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2020-07-28 18:12:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:56,278 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-28 18:12:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-28 18:12:56,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:56,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:56,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:56,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 18:12:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-28 18:12:56,282 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2020-07-28 18:12:56,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:56,282 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-28 18:12:56,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:12:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-28 18:12:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 18:12:56,284 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:56,284 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:56,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:56,497 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash 833881267, now seen corresponding path program 3 times [2020-07-28 18:12:56,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:56,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018531449] [2020-07-28 18:12:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:56,597 INFO L280 TraceCheckUtils]: 0: Hoare triple {264#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {264#true} is VALID [2020-07-28 18:12:56,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {264#true} havoc main_#res;havoc main_#t~post0, main_#t~mem1, main_~#A~0.base, main_~#A~0.offset, main_~i~0;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0;main_~i~0 := 0; {266#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:56,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {266#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {266#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:56,602 INFO L280 TraceCheckUtils]: 3: Hoare triple {266#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {267#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:56,603 INFO L280 TraceCheckUtils]: 4: Hoare triple {267#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {267#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:56,604 INFO L280 TraceCheckUtils]: 5: Hoare triple {267#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {268#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:56,605 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {268#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:56,606 INFO L280 TraceCheckUtils]: 7: Hoare triple {268#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {269#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:56,607 INFO L280 TraceCheckUtils]: 8: Hoare triple {269#(<= ULTIMATE.start_main_~i~0 3)} assume !(main_~i~0 < 1024); {265#false} is VALID [2020-07-28 18:12:56,608 INFO L280 TraceCheckUtils]: 9: Hoare triple {265#false} call main_#t~mem1 := read~int(main_~#A~0.base, 4092 + main_~#A~0.offset, 4);__VERIFIER_assert_#in~cond := (if 1023 == main_#t~mem1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {265#false} is VALID [2020-07-28 18:12:56,608 INFO L280 TraceCheckUtils]: 10: Hoare triple {265#false} assume 0 == __VERIFIER_assert_~cond; {265#false} is VALID [2020-07-28 18:12:56,609 INFO L280 TraceCheckUtils]: 11: Hoare triple {265#false} assume !false; {265#false} is VALID [2020-07-28 18:12:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:56,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018531449] [2020-07-28 18:12:56,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214799040] [2020-07-28 18:12:56,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-28 18:12:56,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-28 18:12:56,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:56,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 18:12:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:56,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:56,717 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2020-07-28 18:12:56,718 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 18:12:56,727 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:12:56,727 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 18:12:56,728 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-07-28 18:12:57,034 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:57,157 INFO L280 TraceCheckUtils]: 0: Hoare triple {264#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {264#true} is VALID [2020-07-28 18:12:57,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {264#true} havoc main_#res;havoc main_#t~post0, main_#t~mem1, main_~#A~0.base, main_~#A~0.offset, main_~i~0;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0;main_~i~0 := 0; {264#true} is VALID [2020-07-28 18:12:57,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {264#true} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {264#true} is VALID [2020-07-28 18:12:57,159 INFO L280 TraceCheckUtils]: 3: Hoare triple {264#true} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {264#true} is VALID [2020-07-28 18:12:57,159 INFO L280 TraceCheckUtils]: 4: Hoare triple {264#true} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {264#true} is VALID [2020-07-28 18:12:57,159 INFO L280 TraceCheckUtils]: 5: Hoare triple {264#true} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {264#true} is VALID [2020-07-28 18:12:57,160 INFO L280 TraceCheckUtils]: 6: Hoare triple {264#true} assume !!(main_~i~0 < 1024);call write~int(main_~i~0, main_~#A~0.base, main_~#A~0.offset + 4 * main_~i~0, 4); {291#(and (= ULTIMATE.start_main_~i~0 (select (select |#memory_int| |ULTIMATE.start_main_~#A~0.base|) (+ |ULTIMATE.start_main_~#A~0.offset| (* ULTIMATE.start_main_~i~0 4)))) (< ULTIMATE.start_main_~i~0 1024))} is VALID [2020-07-28 18:12:57,165 INFO L280 TraceCheckUtils]: 7: Hoare triple {291#(and (= ULTIMATE.start_main_~i~0 (select (select |#memory_int| |ULTIMATE.start_main_~#A~0.base|) (+ |ULTIMATE.start_main_~#A~0.offset| (* ULTIMATE.start_main_~i~0 4)))) (< ULTIMATE.start_main_~i~0 1024))} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {295#(exists ((v_ULTIMATE.start_main_~i~0_12 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0.base|) (+ |ULTIMATE.start_main_~#A~0.offset| (* v_ULTIMATE.start_main_~i~0_12 4))) v_ULTIMATE.start_main_~i~0_12) (<= ULTIMATE.start_main_~i~0 (+ v_ULTIMATE.start_main_~i~0_12 1)) (< v_ULTIMATE.start_main_~i~0_12 1024)))} is VALID [2020-07-28 18:12:57,171 INFO L280 TraceCheckUtils]: 8: Hoare triple {295#(exists ((v_ULTIMATE.start_main_~i~0_12 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0.base|) (+ |ULTIMATE.start_main_~#A~0.offset| (* v_ULTIMATE.start_main_~i~0_12 4))) v_ULTIMATE.start_main_~i~0_12) (<= ULTIMATE.start_main_~i~0 (+ v_ULTIMATE.start_main_~i~0_12 1)) (< v_ULTIMATE.start_main_~i~0_12 1024)))} assume !(main_~i~0 < 1024); {299#(exists ((v_ULTIMATE.start_main_~i~0_12 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0.base|) (+ |ULTIMATE.start_main_~#A~0.offset| (* v_ULTIMATE.start_main_~i~0_12 4))) v_ULTIMATE.start_main_~i~0_12) (<= 1023 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~i~0_12 1024)))} is VALID [2020-07-28 18:12:57,173 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#(exists ((v_ULTIMATE.start_main_~i~0_12 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0.base|) (+ |ULTIMATE.start_main_~#A~0.offset| (* v_ULTIMATE.start_main_~i~0_12 4))) v_ULTIMATE.start_main_~i~0_12) (<= 1023 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~i~0_12 1024)))} call main_#t~mem1 := read~int(main_~#A~0.base, 4092 + main_~#A~0.offset, 4);__VERIFIER_assert_#in~cond := (if 1023 == main_#t~mem1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {303#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:57,174 INFO L280 TraceCheckUtils]: 10: Hoare triple {303#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {265#false} is VALID [2020-07-28 18:12:57,175 INFO L280 TraceCheckUtils]: 11: Hoare triple {265#false} assume !false; {265#false} is VALID [2020-07-28 18:12:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 18:12:57,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:12:57,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2020-07-28 18:12:57,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029596210] [2020-07-28 18:12:57,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-28 18:12:57,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:57,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:12:57,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:57,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:12:57,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:57,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:12:57,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:12:57,196 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2020-07-28 18:13:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:01,390 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-28 18:13:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:13:01,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-28 18:13:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:13:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2020-07-28 18:13:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:13:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2020-07-28 18:13:01,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 9 transitions. [2020-07-28 18:13:01,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:01,411 INFO L225 Difference]: With dead ends: 13 [2020-07-28 18:13:01,411 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:13:01,412 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:13:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:13:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:13:01,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:01,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:01,413 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:01,413 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:01,414 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:13:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:01,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:01,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:01,415 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:01,415 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:01,415 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:13:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:01,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:01,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:01,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:01,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:13:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:13:01,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-07-28 18:13:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:01,417 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:13:01,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:13:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:01,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:01,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:13:01,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:13:01,663 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:13:01,664 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-28 18:13:01,664 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:13:01,664 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:13:01,664 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:13:01,665 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-28 18:13:01,665 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 16) no Hoare annotation was computed. [2020-07-28 18:13:01,665 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 16) the Hoare annotation is: (or (exists ((v_ULTIMATE.start_main_~i~0_12 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0.base|) (+ |ULTIMATE.start_main_~#A~0.offset| (* v_ULTIMATE.start_main_~i~0_12 4))) v_ULTIMATE.start_main_~i~0_12) (<= ULTIMATE.start_main_~i~0 (+ v_ULTIMATE.start_main_~i~0_12 1)) (< v_ULTIMATE.start_main_~i~0_12 1024))) (= 0 ULTIMATE.start_main_~i~0)) [2020-07-28 18:13:01,665 INFO L268 CegarLoopResult]: For program point L14-4(lines 14 16) no Hoare annotation was computed. [2020-07-28 18:13:01,665 INFO L268 CegarLoopResult]: For program point L10(lines 10 19) no Hoare annotation was computed. [2020-07-28 18:13:01,666 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-28 18:13:01,666 INFO L271 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2020-07-28 18:13:01,670 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:13:01,670 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:13:01,670 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2020-07-28 18:13:01,671 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2020-07-28 18:13:01,671 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-28 18:13:01,671 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2020-07-28 18:13:01,671 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-28 18:13:01,671 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:13:01,672 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:13:01,672 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:13:01,672 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:13:01,672 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 18:13:01,672 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 18:13:01,673 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:13:01,673 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:13:01,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 18:13:01,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 18:13:01,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:13:01 BoogieIcfgContainer [2020-07-28 18:13:01,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:13:01,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:13:01,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:13:01,692 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:13:01,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:54" (3/4) ... [2020-07-28 18:13:01,697 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:13:01,708 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-07-28 18:13:01,709 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 18:13:01,709 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:13:01,739 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_ULTIMATE.start_main_~i~0_12 : int :: (unknown-#memory_int-unknown[A][A + v_ULTIMATE.start_main_~i~0_12 * 4] == v_ULTIMATE.start_main_~i~0_12 && i <= v_ULTIMATE.start_main_~i~0_12 + 1) && v_ULTIMATE.start_main_~i~0_12 < 1024) || 0 == i [2020-07-28 18:13:01,752 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:13:01,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:13:01,755 INFO L168 Benchmark]: Toolchain (without parser) took 7916.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 956.2 MB in the beginning and 870.3 MB in the end (delta: 85.9 MB). Peak memory consumption was 231.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:01,756 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:01,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.64 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:01,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:01,758 INFO L168 Benchmark]: Boogie Preprocessor took 27.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:01,759 INFO L168 Benchmark]: RCFGBuilder took 386.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:01,760 INFO L168 Benchmark]: TraceAbstraction took 7063.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.3 MB in the end (delta: 246.3 MB). Peak memory consumption was 246.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:01,760 INFO L168 Benchmark]: Witness Printer took 61.04 ms. Allocated memory is still 1.2 GB. Free memory is still 870.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:01,764 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.64 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 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 102.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 386.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7063.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.3 MB in the end (delta: 246.3 MB). Peak memory consumption was 246.3 MB. Max. memory is 11.5 GB. * Witness Printer took 61.04 ms. Allocated memory is still 1.2 GB. Free memory is still 870.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-28 18:13:01,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 18:13:01,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_12,QUANTIFIED] [2020-07-28 18:13:01,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (\exists v_ULTIMATE.start_main_~i~0_12 : int :: (unknown-#memory_int-unknown[A][A + v_ULTIMATE.start_main_~i~0_12 * 4] == v_ULTIMATE.start_main_~i~0_12 && i <= v_ULTIMATE.start_main_~i~0_12 + 1) && v_ULTIMATE.start_main_~i~0_12 < 1024) || 0 == i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.9s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 SDtfs, 9 SDslu, 30 SDs, 0 SdLazy, 40 SolverSat, 3 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 6 NumberOfFragments, 26 HoareAnnotationTreeSize, 2 FomulaSimplifications, 50 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 59 ConstructedInterpolants, 2 QuantifiedInterpolants, 1549 SizeOfPredicates, 9 NumberOfNonLiveVariables, 104 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 9/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...