./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs3f.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/array-fpi/brs3f.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 7d77f9312fa564f318653c1feb258597222f4280 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 14:48:46,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:48:46,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:48:46,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:48:46,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:48:46,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:48:46,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:48:46,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:48:46,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:48:46,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:48:46,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:48:46,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:48:46,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:48:46,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:48:46,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:48:46,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:48:46,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:48:46,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:48:46,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:48:46,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:48:46,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:48:46,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:48:46,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:48:46,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:48:46,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:48:46,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:48:46,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:48:46,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:48:46,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:48:46,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:48:46,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:48:46,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:48:46,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:48:46,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:48:46,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:48:46,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:48:46,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:48:46,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:48:46,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:48:46,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:48:46,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:48:46,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 14:48:46,465 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:48:46,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:48:46,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:48:46,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:48:46,470 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:48:46,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:48:46,471 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:48:46,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:48:46,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:48:46,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:48:46,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:48:46,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:48:46,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:48:46,474 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:48:46,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:48:46,474 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:48:46,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:48:46,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:48:46,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:48:46,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:48:46,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:48:46,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:48:46,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:48:46,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:48:46,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:48:46,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:48:46,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:48:46,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:48:46,479 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:48:46,479 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 -> 7d77f9312fa564f318653c1feb258597222f4280 [2020-07-28 14:48:46,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:48:46,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:48:46,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:48:46,880 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:48:46,882 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:48:46,883 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs3f.c [2020-07-28 14:48:46,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054ce59d7/b00d3a75c6ff49719d66330d2bb334a0/FLAGca80c2396 [2020-07-28 14:48:47,370 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:48:47,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3f.c [2020-07-28 14:48:47,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054ce59d7/b00d3a75c6ff49719d66330d2bb334a0/FLAGca80c2396 [2020-07-28 14:48:47,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054ce59d7/b00d3a75c6ff49719d66330d2bb334a0 [2020-07-28 14:48:47,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:48:47,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:48:47,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:48:47,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:48:47,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:48:47,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:48:47" (1/1) ... [2020-07-28 14:48:47,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674049d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:47, skipping insertion in model container [2020-07-28 14:48:47,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:48:47" (1/1) ... [2020-07-28 14:48:47,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:48:47,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:48:48,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:48:48,037 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:48:48,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:48:48,079 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:48:48,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48 WrapperNode [2020-07-28 14:48:48,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:48:48,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:48:48,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:48:48,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:48:48,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (1/1) ... [2020-07-28 14:48:48,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (1/1) ... [2020-07-28 14:48:48,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:48:48,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:48:48,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:48:48,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:48:48,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (1/1) ... [2020-07-28 14:48:48,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (1/1) ... [2020-07-28 14:48:48,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (1/1) ... [2020-07-28 14:48:48,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (1/1) ... [2020-07-28 14:48:48,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (1/1) ... [2020-07-28 14:48:48,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (1/1) ... [2020-07-28 14:48:48,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (1/1) ... [2020-07-28 14:48:48,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:48:48,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:48:48,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:48:48,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:48:48,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (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 14:48:48,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:48:48,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:48:48,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 14:48:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:48:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:48:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:48:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:48:48,606 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:48:48,607 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-28 14:48:48,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:48:48 BoogieIcfgContainer [2020-07-28 14:48:48,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:48:48,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:48:48,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:48:48,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:48:48,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:48:47" (1/3) ... [2020-07-28 14:48:48,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e14624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:48:48, skipping insertion in model container [2020-07-28 14:48:48,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:48:48" (2/3) ... [2020-07-28 14:48:48,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e14624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:48:48, skipping insertion in model container [2020-07-28 14:48:48,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:48:48" (3/3) ... [2020-07-28 14:48:48,623 INFO L109 eAbstractionObserver]: Analyzing ICFG brs3f.c [2020-07-28 14:48:48,636 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:48:48,647 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:48:48,667 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:48:48,695 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:48:48,695 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:48:48,696 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:48:48,696 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:48:48,696 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:48:48,696 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:48:48,697 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:48:48,697 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:48:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-28 14:48:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:48:48,722 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:48:48,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:48:48,724 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:48:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:48:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2020-07-28 14:48:48,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:48:48,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932468063] [2020-07-28 14:48:48,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:48:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:48:48,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {23#true} is VALID [2020-07-28 14:48:48,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem6, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {23#true} is VALID [2020-07-28 14:48:48,896 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23#true} is VALID [2020-07-28 14:48:48,903 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#true} assume 0 == assume_abort_if_not_~cond;assume false; {24#false} is VALID [2020-07-28 14:48:48,904 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#false} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {24#false} is VALID [2020-07-28 14:48:48,904 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#false} assume !(main_~i~0 < ~N~0); {24#false} is VALID [2020-07-28 14:48:48,904 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#false} main_~i~0 := 0; {24#false} is VALID [2020-07-28 14:48:48,905 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} assume !true; {24#false} is VALID [2020-07-28 14:48:48,905 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} call main_#t~mem6 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem6 <= 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24#false} is VALID [2020-07-28 14:48:48,905 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == __VERIFIER_assert_~cond; {24#false} is VALID [2020-07-28 14:48:48,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-28 14:48:48,909 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 14:48:48,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932468063] [2020-07-28 14:48:48,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:48:48,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:48:48,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684971] [2020-07-28 14:48:48,918 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 14:48:48,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:48:48,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:48:48,973 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 14:48:48,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:48:48,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:48:48,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:48:48,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:48:48,984 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-28 14:48:49,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:49,043 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-07-28 14:48:49,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:48:49,044 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 14:48:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:48:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:48:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 14:48:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:48:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 14:48:49,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 14:48:49,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:48:49,157 INFO L225 Difference]: With dead ends: 36 [2020-07-28 14:48:49,157 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 14:48:49,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:48:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 14:48:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 14:48:49,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:48:49,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 14:48:49,199 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 14:48:49,199 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 14:48:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:49,202 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-28 14:48:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-28 14:48:49,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:48:49,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:48:49,204 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 14:48:49,204 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 14:48:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:49,207 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-28 14:48:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-28 14:48:49,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:48:49,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:48:49,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:48:49,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:48:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 14:48:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-07-28 14:48:49,213 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2020-07-28 14:48:49,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:48:49,214 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-07-28 14:48:49,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:48:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-28 14:48:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:48:49,215 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:48:49,215 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:48:49,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:48:49,216 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:48:49,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:48:49,217 INFO L82 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2020-07-28 14:48:49,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:48:49,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035692443] [2020-07-28 14:48:49,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:48:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:48:49,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {119#true} is VALID [2020-07-28 14:48:49,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {119#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem6, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {119#true} is VALID [2020-07-28 14:48:49,348 INFO L280 TraceCheckUtils]: 2: Hoare triple {119#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {121#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,349 INFO L280 TraceCheckUtils]: 3: Hoare triple {121#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond); {121#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,351 INFO L280 TraceCheckUtils]: 4: Hoare triple {121#(<= 1 ~N~0)} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {122#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-28 14:48:49,352 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} assume !(main_~i~0 < ~N~0); {120#false} is VALID [2020-07-28 14:48:49,353 INFO L280 TraceCheckUtils]: 6: Hoare triple {120#false} main_~i~0 := 0; {120#false} is VALID [2020-07-28 14:48:49,353 INFO L280 TraceCheckUtils]: 7: Hoare triple {120#false} assume !(main_~i~0 < ~N~0); {120#false} is VALID [2020-07-28 14:48:49,353 INFO L280 TraceCheckUtils]: 8: Hoare triple {120#false} call main_#t~mem6 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem6 <= 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {120#false} is VALID [2020-07-28 14:48:49,354 INFO L280 TraceCheckUtils]: 9: Hoare triple {120#false} assume 0 == __VERIFIER_assert_~cond; {120#false} is VALID [2020-07-28 14:48:49,354 INFO L280 TraceCheckUtils]: 10: Hoare triple {120#false} assume !false; {120#false} is VALID [2020-07-28 14:48:49,355 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 14:48:49,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035692443] [2020-07-28 14:48:49,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:48:49,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:48:49,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646764715] [2020-07-28 14:48:49,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 14:48:49,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:48:49,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:48:49,382 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 14:48:49,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:48:49,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:48:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:48:49,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:48:49,384 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 4 states. [2020-07-28 14:48:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:49,496 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-07-28 14:48:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:48:49,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 14:48:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:48:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:48:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2020-07-28 14:48:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:48:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2020-07-28 14:48:49,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2020-07-28 14:48:49,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:48:49,574 INFO L225 Difference]: With dead ends: 33 [2020-07-28 14:48:49,574 INFO L226 Difference]: Without dead ends: 22 [2020-07-28 14:48:49,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:48:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-28 14:48:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-28 14:48:49,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:48:49,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2020-07-28 14:48:49,587 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2020-07-28 14:48:49,587 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2020-07-28 14:48:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:49,590 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-07-28 14:48:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-28 14:48:49,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:48:49,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:48:49,591 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2020-07-28 14:48:49,592 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2020-07-28 14:48:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:49,594 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-07-28 14:48:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-28 14:48:49,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:48:49,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:48:49,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:48:49,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:48:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 14:48:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-07-28 14:48:49,598 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2020-07-28 14:48:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:48:49,599 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-28 14:48:49,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:48:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-28 14:48:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-28 14:48:49,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:48:49,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:48:49,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:48:49,601 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:48:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:48:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2020-07-28 14:48:49,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:48:49,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939217294] [2020-07-28 14:48:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:48:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:48:49,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {232#true} is VALID [2020-07-28 14:48:49,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem6, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {232#true} is VALID [2020-07-28 14:48:49,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {232#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {234#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,736 INFO L280 TraceCheckUtils]: 3: Hoare triple {234#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond); {234#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {234#(<= 1 ~N~0)} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {234#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,738 INFO L280 TraceCheckUtils]: 5: Hoare triple {234#(<= 1 ~N~0)} assume !!(main_~i~0 < ~N~0); {234#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,739 INFO L280 TraceCheckUtils]: 6: Hoare triple {234#(<= 1 ~N~0)} assume 0 == (if main_~i~0 < 0 && 0 != main_~i~0 % 3 then main_~i~0 % 3 - 3 else main_~i~0 % 3);call write~int(3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {234#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,740 INFO L280 TraceCheckUtils]: 7: Hoare triple {234#(<= 1 ~N~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {234#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,741 INFO L280 TraceCheckUtils]: 8: Hoare triple {234#(<= 1 ~N~0)} assume !(main_~i~0 < ~N~0); {234#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,742 INFO L280 TraceCheckUtils]: 9: Hoare triple {234#(<= 1 ~N~0)} main_~i~0 := 0; {234#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,743 INFO L280 TraceCheckUtils]: 10: Hoare triple {234#(<= 1 ~N~0)} assume !!(main_~i~0 < ~N~0); {234#(<= 1 ~N~0)} is VALID [2020-07-28 14:48:49,745 INFO L280 TraceCheckUtils]: 11: Hoare triple {234#(<= 1 ~N~0)} assume 0 == main_~i~0;call write~int(0, main_~#sum~0.base, main_~#sum~0.offset, 8); {235#(and (<= 1 ~N~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:48:49,746 INFO L280 TraceCheckUtils]: 12: Hoare triple {235#(and (<= 1 ~N~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {235#(and (<= 1 ~N~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:48:49,748 INFO L280 TraceCheckUtils]: 13: Hoare triple {235#(and (<= 1 ~N~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} assume !(main_~i~0 < ~N~0); {235#(and (<= 1 ~N~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} is VALID [2020-07-28 14:48:49,749 INFO L280 TraceCheckUtils]: 14: Hoare triple {235#(and (<= 1 ~N~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|) |ULTIMATE.start_main_~#sum~0.offset|)))} call main_#t~mem6 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem6 <= 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {236#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 14:48:49,750 INFO L280 TraceCheckUtils]: 15: Hoare triple {236#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {233#false} is VALID [2020-07-28 14:48:49,751 INFO L280 TraceCheckUtils]: 16: Hoare triple {233#false} assume !false; {233#false} is VALID [2020-07-28 14:48:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 14:48:49,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939217294] [2020-07-28 14:48:49,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:48:49,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 14:48:49,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655258543] [2020-07-28 14:48:49,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-28 14:48:49,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:48:49,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 14:48:49,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:48:49,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 14:48:49,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:48:49,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 14:48:49,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:48:49,784 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2020-07-28 14:48:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:49,923 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-28 14:48:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 14:48:49,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-28 14:48:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:48:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:48:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 14:48:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:48:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 14:48:49,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-28 14:48:49,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:48:49,967 INFO L225 Difference]: With dead ends: 27 [2020-07-28 14:48:49,968 INFO L226 Difference]: Without dead ends: 23 [2020-07-28 14:48:49,968 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 14:48:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-28 14:48:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-28 14:48:49,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:48:49,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2020-07-28 14:48:49,986 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2020-07-28 14:48:49,987 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2020-07-28 14:48:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:49,989 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-28 14:48:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-28 14:48:49,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:48:49,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:48:49,991 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2020-07-28 14:48:49,991 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2020-07-28 14:48:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:49,993 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-28 14:48:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-28 14:48:49,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:48:49,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:48:49,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:48:49,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:48:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 14:48:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-07-28 14:48:49,997 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2020-07-28 14:48:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:48:49,998 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-07-28 14:48:49,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 14:48:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-28 14:48:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 14:48:50,000 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:48:50,000 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:48:50,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 14:48:50,001 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:48:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:48:50,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2020-07-28 14:48:50,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:48:50,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205813807] [2020-07-28 14:48:50,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:48:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:48:50,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {346#true} is VALID [2020-07-28 14:48:50,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {346#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem6, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {346#true} is VALID [2020-07-28 14:48:50,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {346#true} is VALID [2020-07-28 14:48:50,145 INFO L280 TraceCheckUtils]: 3: Hoare triple {346#true} assume !(0 == assume_abort_if_not_~cond); {346#true} is VALID [2020-07-28 14:48:50,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {346#true} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {348#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:48:50,147 INFO L280 TraceCheckUtils]: 5: Hoare triple {348#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0); {348#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:48:50,148 INFO L280 TraceCheckUtils]: 6: Hoare triple {348#(= 0 ULTIMATE.start_main_~i~0)} assume 0 == (if main_~i~0 < 0 && 0 != main_~i~0 % 3 then main_~i~0 % 3 - 3 else main_~i~0 % 3);call write~int(3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {348#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:48:50,149 INFO L280 TraceCheckUtils]: 7: Hoare triple {348#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {349#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 14:48:50,150 INFO L280 TraceCheckUtils]: 8: Hoare triple {349#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < ~N~0); {350#(<= ~N~0 1)} is VALID [2020-07-28 14:48:50,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {350#(<= ~N~0 1)} main_~i~0 := 0; {351#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:48:50,153 INFO L280 TraceCheckUtils]: 10: Hoare triple {351#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0); {351#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:48:50,154 INFO L280 TraceCheckUtils]: 11: Hoare triple {351#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume 0 == main_~i~0;call write~int(0, main_~#sum~0.base, main_~#sum~0.offset, 8); {351#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:48:50,155 INFO L280 TraceCheckUtils]: 12: Hoare triple {351#(and (= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {352#(<= ~N~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:48:50,156 INFO L280 TraceCheckUtils]: 13: Hoare triple {352#(<= ~N~0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0); {347#false} is VALID [2020-07-28 14:48:50,157 INFO L280 TraceCheckUtils]: 14: Hoare triple {347#false} assume !(0 == main_~i~0);call main_#t~mem4 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem5 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem4 + main_#t~mem5, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem4;havoc main_#t~mem5; {347#false} is VALID [2020-07-28 14:48:50,157 INFO L280 TraceCheckUtils]: 15: Hoare triple {347#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {347#false} is VALID [2020-07-28 14:48:50,157 INFO L280 TraceCheckUtils]: 16: Hoare triple {347#false} assume !(main_~i~0 < ~N~0); {347#false} is VALID [2020-07-28 14:48:50,158 INFO L280 TraceCheckUtils]: 17: Hoare triple {347#false} call main_#t~mem6 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem6 <= 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {347#false} is VALID [2020-07-28 14:48:50,158 INFO L280 TraceCheckUtils]: 18: Hoare triple {347#false} assume 0 == __VERIFIER_assert_~cond; {347#false} is VALID [2020-07-28 14:48:50,159 INFO L280 TraceCheckUtils]: 19: Hoare triple {347#false} assume !false; {347#false} is VALID [2020-07-28 14:48:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:48:50,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205813807] [2020-07-28 14:48:50,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866667206] [2020-07-28 14:48:50,161 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 14:48:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:48:50,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 14:48:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:48:50,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:48:50,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {346#true} is VALID [2020-07-28 14:48:50,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {346#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem6, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {346#true} is VALID [2020-07-28 14:48:50,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {346#true} is VALID [2020-07-28 14:48:50,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {346#true} assume !(0 == assume_abort_if_not_~cond); {346#true} is VALID [2020-07-28 14:48:50,490 INFO L280 TraceCheckUtils]: 4: Hoare triple {346#true} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {368#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 14:48:50,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {368#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < ~N~0); {368#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 14:48:50,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {368#(<= ULTIMATE.start_main_~i~0 0)} assume 0 == (if main_~i~0 < 0 && 0 != main_~i~0 % 3 then main_~i~0 % 3 - 3 else main_~i~0 % 3);call write~int(3, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4); {368#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 14:48:50,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {368#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {349#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 14:48:50,495 INFO L280 TraceCheckUtils]: 8: Hoare triple {349#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < ~N~0); {350#(<= ~N~0 1)} is VALID [2020-07-28 14:48:50,496 INFO L280 TraceCheckUtils]: 9: Hoare triple {350#(<= ~N~0 1)} main_~i~0 := 0; {384#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:48:50,497 INFO L280 TraceCheckUtils]: 10: Hoare triple {384#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0); {384#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:48:50,498 INFO L280 TraceCheckUtils]: 11: Hoare triple {384#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume 0 == main_~i~0;call write~int(0, main_~#sum~0.base, main_~#sum~0.offset, 8); {384#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:48:50,500 INFO L280 TraceCheckUtils]: 12: Hoare triple {384#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {394#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2020-07-28 14:48:50,501 INFO L280 TraceCheckUtils]: 13: Hoare triple {394#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0); {347#false} is VALID [2020-07-28 14:48:50,501 INFO L280 TraceCheckUtils]: 14: Hoare triple {347#false} assume !(0 == main_~i~0);call main_#t~mem4 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);call main_#t~mem5 := read~int(main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem4 + main_#t~mem5, main_~#sum~0.base, main_~#sum~0.offset, 8);havoc main_#t~mem4;havoc main_#t~mem5; {347#false} is VALID [2020-07-28 14:48:50,502 INFO L280 TraceCheckUtils]: 15: Hoare triple {347#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {347#false} is VALID [2020-07-28 14:48:50,502 INFO L280 TraceCheckUtils]: 16: Hoare triple {347#false} assume !(main_~i~0 < ~N~0); {347#false} is VALID [2020-07-28 14:48:50,502 INFO L280 TraceCheckUtils]: 17: Hoare triple {347#false} call main_#t~mem6 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem6 <= 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {347#false} is VALID [2020-07-28 14:48:50,503 INFO L280 TraceCheckUtils]: 18: Hoare triple {347#false} assume 0 == __VERIFIER_assert_~cond; {347#false} is VALID [2020-07-28 14:48:50,503 INFO L280 TraceCheckUtils]: 19: Hoare triple {347#false} assume !false; {347#false} is VALID [2020-07-28 14:48:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:48:50,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:48:50,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 14:48:50,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80080555] [2020-07-28 14:48:50,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-28 14:48:50,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:48:50,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 14:48:50,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:48:50,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 14:48:50,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:48:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 14:48:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-28 14:48:50,548 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 10 states. [2020-07-28 14:48:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:50,881 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2020-07-28 14:48:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 14:48:50,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-28 14:48:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:48:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:48:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-28 14:48:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 14:48:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-28 14:48:50,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2020-07-28 14:48:50,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:48:50,956 INFO L225 Difference]: With dead ends: 43 [2020-07-28 14:48:50,956 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 14:48:50,957 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-28 14:48:50,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 14:48:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2020-07-28 14:48:50,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:48:50,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 25 states. [2020-07-28 14:48:50,970 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 25 states. [2020-07-28 14:48:50,970 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 25 states. [2020-07-28 14:48:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:50,973 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-28 14:48:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2020-07-28 14:48:50,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:48:50,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:48:50,974 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 29 states. [2020-07-28 14:48:50,974 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 29 states. [2020-07-28 14:48:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:48:50,976 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-28 14:48:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2020-07-28 14:48:50,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:48:50,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:48:50,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:48:50,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:48:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-28 14:48:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-28 14:48:50,980 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2020-07-28 14:48:50,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:48:50,981 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-28 14:48:50,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 14:48:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 14:48:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 14:48:50,982 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:48:50,982 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:48:51,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:48:51,198 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:48:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:48:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash 168847774, now seen corresponding path program 1 times [2020-07-28 14:48:51,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:48:51,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63329278] [2020-07-28 14:48:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:48:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:48:51,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:48:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:48:51,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:48:51,304 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:48:51,304 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:48:51,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 14:48:51,356 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:48:51,358 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:48:51,358 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:48:51,359 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:48:51,360 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 14:48:51,360 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:48:51,360 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:48:51,361 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:48:51,361 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 14:48:51,361 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-28 14:48:51,361 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-28 14:48:51,362 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-28 14:48:51,362 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-28 14:48:51,362 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 14:48:51,362 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 14:48:51,362 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-28 14:48:51,363 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-28 14:48:51,363 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-28 14:48:51,363 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-28 14:48:51,363 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-28 14:48:51,363 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 14:48:51,364 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 14:48:51,364 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:48:51,364 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:48:51,364 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-28 14:48:51,365 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:48:51,365 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:48:51,365 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 14:48:51,365 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 14:48:51,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:48:51 BoogieIcfgContainer [2020-07-28 14:48:51,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:48:51,372 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:48:51,372 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:48:51,373 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:48:51,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:48:48" (3/4) ... [2020-07-28 14:48:51,376 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:48:51,472 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:48:51,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:48:51,476 INFO L168 Benchmark]: Toolchain (without parser) took 3701.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 950.9 MB in the beginning and 841.8 MB in the end (delta: 109.1 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:48:51,476 INFO L168 Benchmark]: CDTParser took 0.95 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 14:48:51,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.25 ms. Allocated memory is still 1.0 GB. Free memory was 950.9 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:48:51,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:48:51,478 INFO L168 Benchmark]: Boogie Preprocessor took 29.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:48:51,479 INFO L168 Benchmark]: RCFGBuilder took 405.22 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:48:51,480 INFO L168 Benchmark]: TraceAbstraction took 2755.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 841.8 MB in the end (delta: 257.3 MB). Peak memory consumption was 257.3 MB. Max. memory is 11.5 GB. [2020-07-28 14:48:51,480 INFO L168 Benchmark]: Witness Printer took 100.71 ms. Allocated memory is still 1.2 GB. Free memory is still 841.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:48:51,484 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.95 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 303.25 ms. Allocated memory is still 1.0 GB. Free memory was 950.9 MB in the beginning and 940.1 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 96.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 405.22 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2755.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 841.8 MB in the end (delta: 257.3 MB). Peak memory consumption was 257.3 MB. Max. memory is 11.5 GB. * Witness Printer took 100.71 ms. Allocated memory is still 1.2 GB. Free memory is still 841.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) [L11] COND FALSE !(!cond) VAL [N=2] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] i=0 VAL [N=2] [L29] COND TRUE i