./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/count_down_unsafe.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/count_down_unsafe.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f9f8e12a96bbd82b23d1fc92b67fc377b3c783a366d4cad2924c946b146eff3f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:39:06,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:39:06,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:39:06,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:39:06,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:39:06,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:39:06,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:39:06,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:39:06,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:39:06,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:39:06,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:39:06,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:39:06,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:39:06,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:39:06,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:39:06,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:39:06,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:39:06,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:39:06,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:39:06,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:39:06,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:39:06,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:39:06,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:39:06,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:39:06,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:39:06,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:39:06,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:39:06,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:39:06,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:39:06,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:39:06,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:39:06,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:39:06,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:39:06,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:39:06,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:39:06,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:39:06,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:39:06,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:39:06,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:39:06,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:39:06,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:39:06,453 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:39:06,474 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:39:06,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:39:06,475 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:39:06,475 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:39:06,476 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:39:06,476 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:39:06,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:39:06,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:39:06,477 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:39:06,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:39:06,478 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:39:06,478 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:39:06,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:39:06,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:39:06,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:39:06,478 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:39:06,479 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:39:06,479 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:39:06,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:39:06,479 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:39:06,479 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:39:06,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:39:06,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:39:06,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:39:06,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:39:06,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:39:06,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:39:06,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:39:06,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:39:06,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:39:06,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f9f8e12a96bbd82b23d1fc92b67fc377b3c783a366d4cad2924c946b146eff3f [2022-02-20 23:39:06,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:39:06,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:39:06,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:39:06,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:39:06,709 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:39:06,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/count_down_unsafe.i [2022-02-20 23:39:06,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa19dee71/f2ccf41a2ae74f9dbc06a00d5643dd7d/FLAG4ea39374d [2022-02-20 23:39:07,136 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:39:07,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down_unsafe.i [2022-02-20 23:39:07,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa19dee71/f2ccf41a2ae74f9dbc06a00d5643dd7d/FLAG4ea39374d [2022-02-20 23:39:07,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa19dee71/f2ccf41a2ae74f9dbc06a00d5643dd7d [2022-02-20 23:39:07,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:39:07,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:39:07,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:39:07,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:39:07,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:39:07,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab894af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07, skipping insertion in model container [2022-02-20 23:39:07,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:39:07,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:39:07,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:39:07,405 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:39:07,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:39:07,444 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:39:07,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07 WrapperNode [2022-02-20 23:39:07,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:39:07,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:39:07,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:39:07,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:39:07,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,482 INFO L137 Inliner]: procedures = 115, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2022-02-20 23:39:07,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:39:07,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:39:07,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:39:07,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:39:07,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:39:07,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:39:07,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:39:07,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:39:07,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (1/1) ... [2022-02-20 23:39:07,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:39:07,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:39:07,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:39:07,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:39:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:39:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:39:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:39:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:39:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:39:07,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:39:07,682 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:39:07,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:39:07,870 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:39:07,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:39:07,875 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:39:07,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:07 BoogieIcfgContainer [2022-02-20 23:39:07,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:39:07,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:39:07,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:39:07,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:39:07,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:39:07" (1/3) ... [2022-02-20 23:39:07,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6188b4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:39:07, skipping insertion in model container [2022-02-20 23:39:07,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:07" (2/3) ... [2022-02-20 23:39:07,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6188b4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:39:07, skipping insertion in model container [2022-02-20 23:39:07,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:07" (3/3) ... [2022-02-20 23:39:07,884 INFO L111 eAbstractionObserver]: Analyzing ICFG count_down_unsafe.i [2022-02-20 23:39:07,888 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:39:07,888 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-02-20 23:39:07,940 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:39:07,948 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:39:07,948 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-02-20 23:39:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:39:07,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:07,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:39:07,986 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:39:07,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash 889508774, now seen corresponding path program 1 times [2022-02-20 23:39:08,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:08,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134163335] [2022-02-20 23:39:08,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:08,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {34#true} is VALID [2022-02-20 23:39:08,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem7#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {34#true} is VALID [2022-02-20 23:39:08,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {34#true} is VALID [2022-02-20 23:39:08,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#true} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {36#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0)))} is VALID [2022-02-20 23:39:08,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0)))} assume main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0;main_#res#1 := 0;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {35#false} is VALID [2022-02-20 23:39:08,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#false} assume !(#valid == main_old_#valid#1); {35#false} is VALID [2022-02-20 23:39:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:08,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:08,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134163335] [2022-02-20 23:39:08,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134163335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:08,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:08,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:39:08,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119153362] [2022-02-20 23:39:08,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:08,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:39:08,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:08,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:08,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:39:08,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:08,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:39:08,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:39:08,242 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:08,326 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 23:39:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:39:08,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:39:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-02-20 23:39:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-02-20 23:39:08,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-02-20 23:39:08,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:08,379 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:39:08,380 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:39:08,381 INFO L932 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 [2022-02-20 23:39:08,386 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:08,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:39:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 23:39:08,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:08,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,407 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,407 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:08,409 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 23:39:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 23:39:08,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:08,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:08,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 23:39:08,410 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 23:39:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:08,412 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 23:39:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 23:39:08,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:08,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:08,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:08,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-02-20 23:39:08,422 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 6 [2022-02-20 23:39:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:08,423 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-02-20 23:39:08,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 23:39:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:39:08,425 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:08,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:08,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:39:08,426 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:39:08,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:08,427 INFO L85 PathProgramCache]: Analyzing trace with hash 119449364, now seen corresponding path program 1 times [2022-02-20 23:39:08,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:08,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326878133] [2022-02-20 23:39:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:08,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:08,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {157#true} is VALID [2022-02-20 23:39:08,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem7#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {157#true} is VALID [2022-02-20 23:39:08,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {157#true} is VALID [2022-02-20 23:39:08,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {157#true} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {159#(= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1)} is VALID [2022-02-20 23:39:08,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {159#(= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {159#(= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1)} is VALID [2022-02-20 23:39:08,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#(= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1)} assume !!(main_~i~0#1 < main_~length~0#1);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~val~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {159#(= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1)} is VALID [2022-02-20 23:39:08,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1)} assume main_~val~0#1 < 0;main_~val~0#1 := 0; {159#(= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1)} is VALID [2022-02-20 23:39:08,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#(= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1)} assume !(1 == #valid[main_~arr~0#1.base]); {158#false} is VALID [2022-02-20 23:39:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:39:08,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:08,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326878133] [2022-02-20 23:39:08,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326878133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:08,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:08,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:39:08,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396901124] [2022-02-20 23:39:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:08,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:39:08,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:08,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:08,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:39:08,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:39:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:39:08,488 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:08,527 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 23:39:08,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:39:08,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:39:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-20 23:39:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-20 23:39:08,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-02-20 23:39:08,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:39:08,579 INFO L225 Difference]: With dead ends: 25 [2022-02-20 23:39:08,579 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 23:39:08,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:39:08,581 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:39:08,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:39:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 23:39:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 23:39:08,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:08,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,587 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,588 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:08,595 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 23:39:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 23:39:08,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:08,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:08,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 23:39:08,597 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 23:39:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:08,600 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 23:39:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 23:39:08,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:08,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:08,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:08,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-20 23:39:08,604 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 8 [2022-02-20 23:39:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:08,615 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-20 23:39:08,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:39:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 23:39:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:39:08,616 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:08,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:39:08,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:39:08,617 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:39:08,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash 119449365, now seen corresponding path program 1 times [2022-02-20 23:39:08,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:08,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626169336] [2022-02-20 23:39:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:08,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:39:08,646 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:39:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:39:08,674 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:39:08,674 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:39:08,675 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (8 of 9 remaining) [2022-02-20 23:39:08,676 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (7 of 9 remaining) [2022-02-20 23:39:08,678 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (6 of 9 remaining) [2022-02-20 23:39:08,679 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (5 of 9 remaining) [2022-02-20 23:39:08,679 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (4 of 9 remaining) [2022-02-20 23:39:08,679 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (3 of 9 remaining) [2022-02-20 23:39:08,679 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (2 of 9 remaining) [2022-02-20 23:39:08,679 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (1 of 9 remaining) [2022-02-20 23:39:08,680 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2022-02-20 23:39:08,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:39:08,686 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 23:39:08,689 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:39:08,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:39:08 BoogieIcfgContainer [2022-02-20 23:39:08,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:39:08,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:39:08,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:39:08,707 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:39:08,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:07" (3/4) ... [2022-02-20 23:39:08,708 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:39:08,737 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:39:08,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:39:08,739 INFO L158 Benchmark]: Toolchain (without parser) took 1575.93ms. Allocated memory was 96.5MB in the beginning and 140.5MB in the end (delta: 44.0MB). Free memory was 61.2MB in the beginning and 105.5MB in the end (delta: -44.3MB). Peak memory consumption was 633.7kB. Max. memory is 16.1GB. [2022-02-20 23:39:08,739 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 96.5MB. Free memory was 70.0MB in the beginning and 69.9MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:39:08,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.48ms. Allocated memory was 96.5MB in the beginning and 140.5MB in the end (delta: 44.0MB). Free memory was 61.2MB in the beginning and 108.6MB in the end (delta: -47.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:39:08,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.91ms. Allocated memory is still 140.5MB. Free memory was 108.6MB in the beginning and 106.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:08,740 INFO L158 Benchmark]: Boogie Preprocessor took 29.43ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 105.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:39:08,740 INFO L158 Benchmark]: RCFGBuilder took 362.97ms. Allocated memory is still 140.5MB. Free memory was 104.4MB in the beginning and 90.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:39:08,740 INFO L158 Benchmark]: TraceAbstraction took 828.76ms. Allocated memory is still 140.5MB. Free memory was 90.6MB in the beginning and 107.6MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:39:08,741 INFO L158 Benchmark]: Witness Printer took 31.47ms. Allocated memory is still 140.5MB. Free memory was 107.6MB in the beginning and 105.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:08,743 INFO L339 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.44ms. Allocated memory is still 96.5MB. Free memory was 70.0MB in the beginning and 69.9MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.48ms. Allocated memory was 96.5MB in the beginning and 140.5MB in the end (delta: 44.0MB). Free memory was 61.2MB in the beginning and 108.6MB in the end (delta: -47.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.91ms. Allocated memory is still 140.5MB. Free memory was 108.6MB in the beginning and 106.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.43ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 105.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 362.97ms. Allocated memory is still 140.5MB. Free memory was 104.4MB in the beginning and 90.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 828.76ms. Allocated memory is still 140.5MB. Free memory was 90.6MB in the beginning and 107.6MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 31.47ms. Allocated memory is still 140.5MB. Free memory was 107.6MB in the beginning and 105.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 524]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L513] int i, j; [L514] int val; [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L516] length = 1 VAL [length=1] [L517] int *arr = __builtin_alloca (length); VAL [__builtin_alloca (length)={2:0}, arr={2:0}, length=1] [L518] COND FALSE !(!arr) [L519] i=0 VAL [__builtin_alloca (length)={2:0}, arr={2:0}, i=0, length=1] [L519] COND TRUE i