./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/reverse_array_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/reverse_array_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 bb17be6c5036a92a96f9e04e4f3a4e1575c4abfe5b11b351c9bb22d6c30d006f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:41:57,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:41:57,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:41:57,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:41:57,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:41:57,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:41:57,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:41:57,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:41:57,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:41:57,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:41:57,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:41:57,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:41:57,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:41:57,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:41:57,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:41:57,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:41:57,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:41:57,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:41:57,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:41:57,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:41:57,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:41:57,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:41:57,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:41:57,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:41:57,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:41:57,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:41:57,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:41:57,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:41:57,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:41:57,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:41:57,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:41:57,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:41:58,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:41:58,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:41:58,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:41:58,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:41:58,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:41:58,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:41:58,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:41:58,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:41:58,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:41:58,004 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:41:58,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:41:58,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:41:58,023 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:41:58,023 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:41:58,024 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:41:58,024 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:41:58,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:41:58,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:41:58,025 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:41:58,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:41:58,025 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:41:58,025 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:41:58,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:41:58,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:41:58,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:41:58,026 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:41:58,026 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:41:58,026 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:41:58,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:41:58,026 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:41:58,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:41:58,027 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:41:58,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:41:58,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:41:58,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:41:58,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:41:58,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:41:58,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:41:58,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:41:58,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:41:58,029 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 -> bb17be6c5036a92a96f9e04e4f3a4e1575c4abfe5b11b351c9bb22d6c30d006f [2022-02-20 23:41:58,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:41:58,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:41:58,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:41:58,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:41:58,245 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:41:58,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/reverse_array_unsafe.i [2022-02-20 23:41:58,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10927128/d425c9cc23164564b909e0a76f179b24/FLAGa676d1360 [2022-02-20 23:41:58,703 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:41:58,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/reverse_array_unsafe.i [2022-02-20 23:41:58,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10927128/d425c9cc23164564b909e0a76f179b24/FLAGa676d1360 [2022-02-20 23:41:59,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10927128/d425c9cc23164564b909e0a76f179b24 [2022-02-20 23:41:59,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:41:59,095 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:41:59,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:41:59,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:41:59,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:41:59,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:41:59" (1/1) ... [2022-02-20 23:41:59,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1299e782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59, skipping insertion in model container [2022-02-20 23:41:59,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:41:59" (1/1) ... [2022-02-20 23:41:59,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:41:59,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:41:59,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:41:59,363 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:41:59,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:41:59,417 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:41:59,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59 WrapperNode [2022-02-20 23:41:59,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:41:59,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:41:59,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:41:59,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:41:59,423 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:41:59" (1/1) ... [2022-02-20 23:41:59,431 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:41:59" (1/1) ... [2022-02-20 23:41:59,447 INFO L137 Inliner]: procedures = 116, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 84 [2022-02-20 23:41:59,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:41:59,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:41:59,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:41:59,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:41:59,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59" (1/1) ... [2022-02-20 23:41:59,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59" (1/1) ... [2022-02-20 23:41:59,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59" (1/1) ... [2022-02-20 23:41:59,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59" (1/1) ... [2022-02-20 23:41:59,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59" (1/1) ... [2022-02-20 23:41:59,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59" (1/1) ... [2022-02-20 23:41:59,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59" (1/1) ... [2022-02-20 23:41:59,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:41:59,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:41:59,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:41:59,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:41:59,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59" (1/1) ... [2022-02-20 23:41:59,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:41:59,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:41:59,493 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:41:59,500 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:41:59,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:41:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:41:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:41:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:41:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:41:59,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:41:59,589 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:41:59,590 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:41:59,877 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:41:59,882 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:41:59,882 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:41:59,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:41:59 BoogieIcfgContainer [2022-02-20 23:41:59,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:41:59,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:41:59,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:41:59,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:41:59,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:41:59" (1/3) ... [2022-02-20 23:41:59,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f41e9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:41:59, skipping insertion in model container [2022-02-20 23:41:59,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:59" (2/3) ... [2022-02-20 23:41:59,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f41e9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:41:59, skipping insertion in model container [2022-02-20 23:41:59,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:41:59" (3/3) ... [2022-02-20 23:41:59,890 INFO L111 eAbstractionObserver]: Analyzing ICFG reverse_array_unsafe.i [2022-02-20 23:41:59,893 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:41:59,893 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-02-20 23:41:59,922 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:41:59,939 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:41:59,940 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-02-20 23:41:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 59 states have internal predecessors, (69), 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:41:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:41:59,954 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:59,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:59,954 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:41:59,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2022-02-20 23:41:59,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:41:59,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110564133] [2022-02-20 23:41:59,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:59,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:42:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:00,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {63#true} is VALID [2022-02-20 23:42:00,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#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~post3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post7#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1.base, main_#t~post16#1.offset, main_#t~post17#1.base, main_#t~post17#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~short13#1, main_~i~0#1, main_~j~0#1, main_~tmp~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~tmp~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; {63#true} is VALID [2022-02-20 23:42:00,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {65#(not (= (* (div |ULTIMATE.start_main_~length~0#1| 2) 2) |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-20 23:42:00,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {65#(not (= (* (div |ULTIMATE.start_main_~length~0#1| 2) 2) |ULTIMATE.start_main_~length~0#1|))} assume 0 == (if main_~length~0#1 < 0 && 0 != main_~length~0#1 % 2 then main_~length~0#1 % 2 - 2 else main_~length~0#1 % 2);main_#t~post3#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {64#false} is VALID [2022-02-20 23:42:00,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {64#false} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;main_~i~1#1 := 0; {64#false} is VALID [2022-02-20 23:42:00,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {64#false} assume !!(main_~i~1#1 < main_~length~0#1);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {64#false} is VALID [2022-02-20 23:42:00,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {64#false} assume !(1 == #valid[main_~arr~0#1.base]); {64#false} is VALID [2022-02-20 23:42:00,220 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:42:00,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:42:00,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110564133] [2022-02-20 23:42:00,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110564133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:00,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:00,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:42:00,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921117112] [2022-02-20 23:42:00,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:00,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-20 23:42:00,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:00,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:42:00,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:00,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:42:00,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:42:00,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:42:00,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:00,262 INFO L87 Difference]: Start difference. First operand has 60 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 59 states have internal predecessors, (69), 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.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:42:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:00,340 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-02-20 23:42:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:42:00,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-20 23:42:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:42:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-02-20 23:42:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:42:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-02-20 23:42:00,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-02-20 23:42:00,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:00,413 INFO L225 Difference]: With dead ends: 61 [2022-02-20 23:42:00,413 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 23:42:00,415 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:42:00,417 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 61 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:00,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 23:42:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-02-20 23:42:00,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:00,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 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:42:00,441 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 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:42:00,442 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 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:42:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:00,449 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-02-20 23:42:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-02-20 23:42:00,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:00,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:00,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 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 59 states. [2022-02-20 23:42:00,452 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 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 59 states. [2022-02-20 23:42:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:00,457 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-02-20 23:42:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-02-20 23:42:00,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:00,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:00,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:00,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 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:42:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-02-20 23:42:00,463 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 7 [2022-02-20 23:42:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:00,463 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-02-20 23:42:00,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:42:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-02-20 23:42:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:42:00,465 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:00,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:00,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:42:00,466 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:42:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088678, now seen corresponding path program 1 times [2022-02-20 23:42:00,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:42:00,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544977011] [2022-02-20 23:42:00,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:00,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:42:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:00,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {306#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {306#true} is VALID [2022-02-20 23:42:00,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#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~post3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post7#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1.base, main_#t~post16#1.offset, main_#t~post17#1.base, main_#t~post17#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~short13#1, main_~i~0#1, main_~j~0#1, main_~tmp~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~tmp~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; {306#true} is VALID [2022-02-20 23:42:00,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {306#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {308#(and (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= (div |ULTIMATE.start_main_~length~0#1| 2) 0))} is VALID [2022-02-20 23:42:00,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {308#(and (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= (div |ULTIMATE.start_main_~length~0#1| 2) 0))} assume !(0 == (if main_~length~0#1 < 0 && 0 != main_~length~0#1 % 2 then main_~length~0#1 % 2 - 2 else main_~length~0#1 % 2)); {308#(and (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= (div |ULTIMATE.start_main_~length~0#1| 2) 0))} is VALID [2022-02-20 23:42:00,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {308#(and (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= (div |ULTIMATE.start_main_~length~0#1| 2) 0))} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;main_~i~1#1 := 0; {309#(and (= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 2) (div |ULTIMATE.start_main_~length~0#1| 2))) 1) (<= 0 |ULTIMATE.start_main_~length~0#1|) (<= (div |ULTIMATE.start_main_~length~0#1| 2) 0))} is VALID [2022-02-20 23:42:00,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#(and (= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1) (= (+ |ULTIMATE.start_main_~length~0#1| (* (- 2) (div |ULTIMATE.start_main_~length~0#1| 2))) 1) (<= 0 |ULTIMATE.start_main_~length~0#1|) (<= (div |ULTIMATE.start_main_~length~0#1| 2) 0))} assume !!(main_~i~1#1 < main_~length~0#1);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {310#(= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1)} is VALID [2022-02-20 23:42:00,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {310#(= (select |#valid| |ULTIMATE.start_main_~arr~0#1.base|) 1)} assume !(1 == #valid[main_~arr~0#1.base]); {307#false} is VALID [2022-02-20 23:42:00,788 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:42:00,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:42:00,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544977011] [2022-02-20 23:42:00,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544977011] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:00,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:00,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:42:00,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689114029] [2022-02-20 23:42:00,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:00,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-02-20 23:42:00,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:00,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:42:00,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:00,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:42:00,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:42:00,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:42:00,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:42:00,803 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:42:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:01,061 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-02-20 23:42:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:42:01,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-02-20 23:42:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:42:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2022-02-20 23:42:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:42:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2022-02-20 23:42:01,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 123 transitions. [2022-02-20 23:42:01,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:01,189 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:42:01,189 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:42:01,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:42:01,190 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 201 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:01,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 57 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:42:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:42:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 54. [2022-02-20 23:42:01,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:01,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 54 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 53 states have internal predecessors, (60), 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:42:01,194 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 54 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 53 states have internal predecessors, (60), 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:42:01,194 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 54 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 53 states have internal predecessors, (60), 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:42:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:01,196 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-02-20 23:42:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-02-20 23:42:01,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:01,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:01,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 53 states have internal predecessors, (60), 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 103 states. [2022-02-20 23:42:01,197 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 53 states have internal predecessors, (60), 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 103 states. [2022-02-20 23:42:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:01,203 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-02-20 23:42:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-02-20 23:42:01,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:01,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:01,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:01,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 53 states have internal predecessors, (60), 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:42:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-02-20 23:42:01,209 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2022-02-20 23:42:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:01,209 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-02-20 23:42:01,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:42:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-02-20 23:42:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:42:01,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:01,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:01,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:42:01,211 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2022-02-20 23:42:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:01,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088679, now seen corresponding path program 1 times [2022-02-20 23:42:01,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:42:01,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709844911] [2022-02-20 23:42:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:01,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:42:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:42:01,233 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:42:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:42:01,264 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:42:01,265 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:42:01,265 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (22 of 23 remaining) [2022-02-20 23:42:01,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (21 of 23 remaining) [2022-02-20 23:42:01,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (20 of 23 remaining) [2022-02-20 23:42:01,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (19 of 23 remaining) [2022-02-20 23:42:01,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (18 of 23 remaining) [2022-02-20 23:42:01,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (17 of 23 remaining) [2022-02-20 23:42:01,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (16 of 23 remaining) [2022-02-20 23:42:01,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (15 of 23 remaining) [2022-02-20 23:42:01,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (14 of 23 remaining) [2022-02-20 23:42:01,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (13 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (12 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (11 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (10 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (9 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (8 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (7 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (6 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (5 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (4 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (3 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (2 of 23 remaining) [2022-02-20 23:42:01,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (1 of 23 remaining) [2022-02-20 23:42:01,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2022-02-20 23:42:01,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:42:01,273 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 23:42:01,275 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:42:01,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:42:01 BoogieIcfgContainer [2022-02-20 23:42:01,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:42:01,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:42:01,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:42:01,288 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:42:01,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:41:59" (3/4) ... [2022-02-20 23:42:01,291 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:42:01,312 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:42:01,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:42:01,313 INFO L158 Benchmark]: Toolchain (without parser) took 2218.36ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 62.6MB in the beginning and 46.3MB in the end (delta: 16.3MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2022-02-20 23:42:01,314 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:42:01,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.53ms. Allocated memory is still 102.8MB. Free memory was 62.4MB in the beginning and 69.1MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:42:01,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.07ms. Allocated memory is still 102.8MB. Free memory was 69.1MB in the beginning and 66.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:42:01,315 INFO L158 Benchmark]: Boogie Preprocessor took 20.67ms. Allocated memory is still 102.8MB. Free memory was 66.9MB in the beginning and 65.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:42:01,315 INFO L158 Benchmark]: RCFGBuilder took 415.07ms. Allocated memory is still 102.8MB. Free memory was 65.2MB in the beginning and 46.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 23:42:01,315 INFO L158 Benchmark]: TraceAbstraction took 1403.13ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 45.7MB in the beginning and 48.4MB in the end (delta: -2.6MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2022-02-20 23:42:01,315 INFO L158 Benchmark]: Witness Printer took 24.25ms. Allocated memory is still 130.0MB. Free memory was 48.4MB in the beginning and 46.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:42:01,320 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.16ms. Allocated memory is still 102.8MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.53ms. Allocated memory is still 102.8MB. Free memory was 62.4MB in the beginning and 69.1MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.07ms. Allocated memory is still 102.8MB. Free memory was 69.1MB in the beginning and 66.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.67ms. Allocated memory is still 102.8MB. Free memory was 66.9MB in the beginning and 65.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 415.07ms. Allocated memory is still 102.8MB. Free memory was 65.2MB in the beginning and 46.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1403.13ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 45.7MB in the beginning and 48.4MB in the end (delta: -2.6MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Witness Printer took 24.25ms. Allocated memory is still 130.0MB. Free memory was 48.4MB in the beginning and 46.3MB 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: 522]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L515] int i, j, tmp; [L516] int length = __VERIFIER_nondet_int(); [L517] COND TRUE length < 1 [L517] length = 1 VAL [length=1] [L518] COND FALSE !(length % 2 == 0) VAL [length=1] [L519] int *arr = __builtin_alloca (length); [L520] int i = 0; VAL [__builtin_alloca (length)={2:0}, arr={2:0}, i=0, length=1] [L520] COND TRUE i < length [L522] arr[i] = __VERIFIER_nondet_int() - UnprovableResult [Line: 522]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 525]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 525]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 525]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 525]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 525]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 525]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 527]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 527]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 514]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 86 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 49 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 23:42:01,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)