./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/quick_sort_split.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/quick_sort_split.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 608b74039fb15a247aaf810504577eacfdbb21e6889e19896989d0cd0427fa05 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:57:18,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:57:18,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:57:18,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:57:18,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:57:18,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:57:18,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:57:18,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:57:18,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:57:18,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:57:18,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:57:18,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:57:18,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:57:18,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:57:18,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:57:18,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:57:18,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:57:18,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:57:18,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:57:18,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:57:18,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:57:18,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:57:18,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:57:18,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:57:18,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:57:18,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:57:18,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:57:18,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:57:18,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:57:18,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:57:18,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:57:18,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:57:18,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:57:18,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:57:18,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:57:18,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:57:18,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:57:18,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:57:18,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:57:18,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:57:18,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:57:18,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:57:18,297 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:57:18,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:57:18,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:57:18,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:57:18,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:57:18,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:57:18,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:57:18,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:57:18,303 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:57:18,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:57:18,304 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:57:18,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:57:18,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:57:18,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:57:18,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:57:18,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:57:18,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:57:18,305 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:57:18,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:57:18,305 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:57:18,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:57:18,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:57:18,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:57:18,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:57:18,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:57:18,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:57:18,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:57:18,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:57:18,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:57:18,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:57:18,308 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:57:18,308 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:57:18,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:57:18,308 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 608b74039fb15a247aaf810504577eacfdbb21e6889e19896989d0cd0427fa05 [2022-02-20 16:57:18,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:57:18,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:57:18,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:57:18,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:57:18,480 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:57:18,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/quick_sort_split.i [2022-02-20 16:57:18,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc64660b3/23a76a399fcd48e8a0df93deb87c22d9/FLAG9c512b174 [2022-02-20 16:57:18,909 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:57:18,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/quick_sort_split.i [2022-02-20 16:57:18,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc64660b3/23a76a399fcd48e8a0df93deb87c22d9/FLAG9c512b174 [2022-02-20 16:57:18,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc64660b3/23a76a399fcd48e8a0df93deb87c22d9 [2022-02-20 16:57:18,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:57:18,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:57:18,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:57:18,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:57:18,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:57:18,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:57:18" (1/1) ... [2022-02-20 16:57:18,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576611a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:18, skipping insertion in model container [2022-02-20 16:57:18,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:57:18" (1/1) ... [2022-02-20 16:57:18,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:57:18,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:57:19,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/quick_sort_split.i[23986,23999] [2022-02-20 16:57:19,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/quick_sort_split.i[24106,24119] [2022-02-20 16:57:19,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:57:19,190 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:57:19,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/quick_sort_split.i[23986,23999] [2022-02-20 16:57:19,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/quick_sort_split.i[24106,24119] [2022-02-20 16:57:19,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:57:19,248 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:57:19,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19 WrapperNode [2022-02-20 16:57:19,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:57:19,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:57:19,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:57:19,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:57:19,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (1/1) ... [2022-02-20 16:57:19,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (1/1) ... [2022-02-20 16:57:19,284 INFO L137 Inliner]: procedures = 125, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2022-02-20 16:57:19,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:57:19,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:57:19,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:57:19,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:57:19,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (1/1) ... [2022-02-20 16:57:19,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (1/1) ... [2022-02-20 16:57:19,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (1/1) ... [2022-02-20 16:57:19,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (1/1) ... [2022-02-20 16:57:19,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (1/1) ... [2022-02-20 16:57:19,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (1/1) ... [2022-02-20 16:57:19,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (1/1) ... [2022-02-20 16:57:19,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:57:19,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:57:19,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:57:19,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:57:19,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (1/1) ... [2022-02-20 16:57:19,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:57:19,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:57:19,334 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 16:57:19,336 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 16:57:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:57:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:57:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:57:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:57:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:57:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:57:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:57:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:57:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:57:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:57:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_list [2022-02-20 16:57:19,358 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_list [2022-02-20 16:57:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:57:19,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:57:19,460 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:57:19,462 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:57:19,629 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:57:19,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:57:19,634 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:57:19,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:57:19 BoogieIcfgContainer [2022-02-20 16:57:19,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:57:19,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:57:19,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:57:19,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:57:19,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:57:18" (1/3) ... [2022-02-20 16:57:19,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b11976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:57:19, skipping insertion in model container [2022-02-20 16:57:19,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:19" (2/3) ... [2022-02-20 16:57:19,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b11976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:57:19, skipping insertion in model container [2022-02-20 16:57:19,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:57:19" (3/3) ... [2022-02-20 16:57:19,641 INFO L111 eAbstractionObserver]: Analyzing ICFG quick_sort_split.i [2022-02-20 16:57:19,656 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:57:19,656 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 16:57:19,692 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:57:19,696 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:57:19,696 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 16:57:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 26 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:57:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:57:19,712 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:57:19,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:57:19,712 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:57:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:57:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2051498666, now seen corresponding path program 1 times [2022-02-20 16:57:19,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:57:19,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470721195] [2022-02-20 16:57:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:57:19,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:57:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:57:19,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {31#true} is VALID [2022-02-20 16:57:19,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1.base, main_#t~ret8#1.offset, main_#t~mem9#1, main_#t~ite10#1.base, main_#t~ite10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~l~0#1.base, main_~l~0#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~list~1#1.base, main_~list~1#1.offset, main_~low~0#1.base, main_~low~0#1.offset, main_~high~0#1.base, main_~high~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;assume { :begin_inline_create_list } true;havoc create_list_#res#1.base, create_list_#res#1.offset;havoc create_list_#t~nondet6#1, create_list_~v~0#1, create_list_#t~nondet5#1, create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset, create_list_~#list~0#1.base, create_list_~#list~0#1.offset;call create_list_~#list~0#1.base, create_list_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, create_list_~#list~0#1.base, create_list_~#list~0#1.offset, 4); {31#true} is VALID [2022-02-20 16:57:19,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-02-20 16:57:19,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#false} call create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset := read~$Pointer$(create_list_~#list~0#1.base, create_list_~#list~0#1.offset, 4);create_list_#res#1.base, create_list_#res#1.offset := create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset;havoc create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset;call ULTIMATE.dealloc(create_list_~#list~0#1.base, create_list_~#list~0#1.offset);havoc create_list_~#list~0#1.base, create_list_~#list~0#1.offset; {32#false} is VALID [2022-02-20 16:57:19,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#false} main_#t~ret8#1.base, main_#t~ret8#1.offset := create_list_#res#1.base, create_list_#res#1.offset;assume { :end_inline_create_list } true;main_~list~1#1.base, main_~list~1#1.offset := main_#t~ret8#1.base, main_#t~ret8#1.offset;havoc main_#t~ret8#1.base, main_#t~ret8#1.offset;main_~low~0#1.base, main_~low~0#1.offset := 0, 0;main_~high~0#1.base, main_~high~0#1.offset := 0, 0;main_~p~0#1.base, main_~p~0#1.offset := main_~list~1#1.base, main_~list~1#1.offset; {32#false} is VALID [2022-02-20 16:57:19,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume !(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {32#false} is VALID [2022-02-20 16:57:19,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#false} assume !!(main_~low~0#1.base != 0 || main_~low~0#1.offset != 0);call main_#t~mem12#1 := read~int(main_~low~0#1.base, main_~low~0#1.offset, 4); {32#false} is VALID [2022-02-20 16:57:19,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} assume !(-1 == main_#t~mem12#1);havoc main_#t~mem12#1; {32#false} is VALID [2022-02-20 16:57:19,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 16:57:19,833 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 16:57:19,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:57:19,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470721195] [2022-02-20 16:57:19,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470721195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:57:19,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:57:19,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:57:19,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90192933] [2022-02-20 16:57:19,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:57:19,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:57:19,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:57:19,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 16:57:19,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:57:19,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:57:19,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:57:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:57:19,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:57:19,881 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 26 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 16:57:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:57:19,939 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-02-20 16:57:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:57:19,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:57:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:57:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 16:57:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2022-02-20 16:57:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 16:57:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2022-02-20 16:57:19,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2022-02-20 16:57:20,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:57:20,032 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:57:20,032 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:57:20,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:57:20,037 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:57:20,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:57:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:57:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:57:20,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:57:20,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:57:20,062 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:57:20,062 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:57:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:57:20,066 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 16:57:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:57:20,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:57:20,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:57:20,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 16:57:20,069 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 16:57:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:57:20,073 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 16:57:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:57:20,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:57:20,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:57:20,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:57:20,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:57:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:57:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 16:57:20,077 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 9 [2022-02-20 16:57:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:57:20,078 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 16:57:20,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 16:57:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:57:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:57:20,081 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:57:20,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:57:20,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:57:20,082 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:57:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:57:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash -804873315, now seen corresponding path program 1 times [2022-02-20 16:57:20,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:57:20,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700407626] [2022-02-20 16:57:20,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:57:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:57:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:57:20,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {170#true} is VALID [2022-02-20 16:57:20,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1.base, main_#t~ret8#1.offset, main_#t~mem9#1, main_#t~ite10#1.base, main_#t~ite10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~l~0#1.base, main_~l~0#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~list~1#1.base, main_~list~1#1.offset, main_~low~0#1.base, main_~low~0#1.offset, main_~high~0#1.base, main_~high~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;assume { :begin_inline_create_list } true;havoc create_list_#res#1.base, create_list_#res#1.offset;havoc create_list_#t~nondet6#1, create_list_~v~0#1, create_list_#t~nondet5#1, create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset, create_list_~#list~0#1.base, create_list_~#list~0#1.offset;call create_list_~#list~0#1.base, create_list_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, create_list_~#list~0#1.base, create_list_~#list~0#1.offset, 4); {170#true} is VALID [2022-02-20 16:57:20,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume -2147483648 <= create_list_#t~nondet5#1 && create_list_#t~nondet5#1 <= 2147483647; {170#true} is VALID [2022-02-20 16:57:20,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {170#true} assume !(0 != create_list_#t~nondet5#1);havoc create_list_#t~nondet5#1; {170#true} is VALID [2022-02-20 16:57:20,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {170#true} call create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset := read~$Pointer$(create_list_~#list~0#1.base, create_list_~#list~0#1.offset, 4);create_list_#res#1.base, create_list_#res#1.offset := create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset;havoc create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset;call ULTIMATE.dealloc(create_list_~#list~0#1.base, create_list_~#list~0#1.offset);havoc create_list_~#list~0#1.base, create_list_~#list~0#1.offset; {170#true} is VALID [2022-02-20 16:57:20,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {170#true} main_#t~ret8#1.base, main_#t~ret8#1.offset := create_list_#res#1.base, create_list_#res#1.offset;assume { :end_inline_create_list } true;main_~list~1#1.base, main_~list~1#1.offset := main_#t~ret8#1.base, main_#t~ret8#1.offset;havoc main_#t~ret8#1.base, main_#t~ret8#1.offset;main_~low~0#1.base, main_~low~0#1.offset := 0, 0;main_~high~0#1.base, main_~high~0#1.offset := 0, 0;main_~p~0#1.base, main_~p~0#1.offset := main_~list~1#1.base, main_~list~1#1.offset; {172#(and (= |ULTIMATE.start_main_~low~0#1.offset| 0) (= |ULTIMATE.start_main_~low~0#1.base| 0))} is VALID [2022-02-20 16:57:20,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#(and (= |ULTIMATE.start_main_~low~0#1.offset| 0) (= |ULTIMATE.start_main_~low~0#1.base| 0))} assume !(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {172#(and (= |ULTIMATE.start_main_~low~0#1.offset| 0) (= |ULTIMATE.start_main_~low~0#1.base| 0))} is VALID [2022-02-20 16:57:20,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(and (= |ULTIMATE.start_main_~low~0#1.offset| 0) (= |ULTIMATE.start_main_~low~0#1.base| 0))} assume !!(main_~low~0#1.base != 0 || main_~low~0#1.offset != 0);call main_#t~mem12#1 := read~int(main_~low~0#1.base, main_~low~0#1.offset, 4); {171#false} is VALID [2022-02-20 16:57:20,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#false} assume !(-1 == main_#t~mem12#1);havoc main_#t~mem12#1; {171#false} is VALID [2022-02-20 16:57:20,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#false} assume !false; {171#false} is VALID [2022-02-20 16:57:20,166 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 16:57:20,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:57:20,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700407626] [2022-02-20 16:57:20,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700407626] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:57:20,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:57:20,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:57:20,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142913327] [2022-02-20 16:57:20,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:57:20,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-02-20 16:57:20,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:57:20,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:57:20,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:57:20,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:57:20,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:57:20,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:57:20,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:57:20,181 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:57:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:57:20,229 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 16:57:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:57:20,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-02-20 16:57:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:57:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:57:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-02-20 16:57:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:57:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-02-20 16:57:20,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-02-20 16:57:20,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:57:20,268 INFO L225 Difference]: With dead ends: 31 [2022-02-20 16:57:20,268 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:57:20,271 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 16:57:20,273 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:57:20,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 37 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:57:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:57:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 16:57:20,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:57:20,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:57:20,280 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:57:20,280 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:57:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:57:20,283 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-20 16:57:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-20 16:57:20,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:57:20,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:57:20,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 16:57:20,286 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 16:57:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:57:20,287 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-20 16:57:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-20 16:57:20,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:57:20,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:57:20,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:57:20,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:57:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:57:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-02-20 16:57:20,291 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 10 [2022-02-20 16:57:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:57:20,291 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-02-20 16:57:20,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:57:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-20 16:57:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:57:20,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:57:20,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:57:20,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:57:20,292 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:57:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:57:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash 818688432, now seen corresponding path program 1 times [2022-02-20 16:57:20,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:57:20,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867019817] [2022-02-20 16:57:20,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:57:20,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:57:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:57:20,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {281#true} is VALID [2022-02-20 16:57:20,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1.base, main_#t~ret8#1.offset, main_#t~mem9#1, main_#t~ite10#1.base, main_#t~ite10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~l~0#1.base, main_~l~0#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~list~1#1.base, main_~list~1#1.offset, main_~low~0#1.base, main_~low~0#1.offset, main_~high~0#1.base, main_~high~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;assume { :begin_inline_create_list } true;havoc create_list_#res#1.base, create_list_#res#1.offset;havoc create_list_#t~nondet6#1, create_list_~v~0#1, create_list_#t~nondet5#1, create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset, create_list_~#list~0#1.base, create_list_~#list~0#1.offset;call create_list_~#list~0#1.base, create_list_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, create_list_~#list~0#1.base, create_list_~#list~0#1.offset, 4); {281#true} is VALID [2022-02-20 16:57:20,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume -2147483648 <= create_list_#t~nondet5#1 && create_list_#t~nondet5#1 <= 2147483647; {281#true} is VALID [2022-02-20 16:57:20,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {281#true} assume !(0 != create_list_#t~nondet5#1);havoc create_list_#t~nondet5#1; {281#true} is VALID [2022-02-20 16:57:20,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {281#true} call create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset := read~$Pointer$(create_list_~#list~0#1.base, create_list_~#list~0#1.offset, 4);create_list_#res#1.base, create_list_#res#1.offset := create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset;havoc create_list_#t~mem7#1.base, create_list_#t~mem7#1.offset;call ULTIMATE.dealloc(create_list_~#list~0#1.base, create_list_~#list~0#1.offset);havoc create_list_~#list~0#1.base, create_list_~#list~0#1.offset; {281#true} is VALID [2022-02-20 16:57:20,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} main_#t~ret8#1.base, main_#t~ret8#1.offset := create_list_#res#1.base, create_list_#res#1.offset;assume { :end_inline_create_list } true;main_~list~1#1.base, main_~list~1#1.offset := main_#t~ret8#1.base, main_#t~ret8#1.offset;havoc main_#t~ret8#1.base, main_#t~ret8#1.offset;main_~low~0#1.base, main_~low~0#1.offset := 0, 0;main_~high~0#1.base, main_~high~0#1.offset := 0, 0;main_~p~0#1.base, main_~p~0#1.offset := main_~list~1#1.base, main_~list~1#1.offset; {283#(and (= |ULTIMATE.start_main_~high~0#1.base| 0) (= |ULTIMATE.start_main_~high~0#1.offset| 0))} is VALID [2022-02-20 16:57:20,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#(and (= |ULTIMATE.start_main_~high~0#1.base| 0) (= |ULTIMATE.start_main_~high~0#1.offset| 0))} assume !(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {283#(and (= |ULTIMATE.start_main_~high~0#1.base| 0) (= |ULTIMATE.start_main_~high~0#1.offset| 0))} is VALID [2022-02-20 16:57:20,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#(and (= |ULTIMATE.start_main_~high~0#1.base| 0) (= |ULTIMATE.start_main_~high~0#1.offset| 0))} assume !(main_~low~0#1.base != 0 || main_~low~0#1.offset != 0); {283#(and (= |ULTIMATE.start_main_~high~0#1.base| 0) (= |ULTIMATE.start_main_~high~0#1.offset| 0))} is VALID [2022-02-20 16:57:20,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#(and (= |ULTIMATE.start_main_~high~0#1.base| 0) (= |ULTIMATE.start_main_~high~0#1.offset| 0))} assume !!(main_~high~0#1.base != 0 || main_~high~0#1.offset != 0);call main_#t~mem14#1 := read~int(main_~high~0#1.base, main_~high~0#1.offset, 4); {282#false} is VALID [2022-02-20 16:57:20,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#false} assume !(1 == main_#t~mem14#1);havoc main_#t~mem14#1; {282#false} is VALID [2022-02-20 16:57:20,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-02-20 16:57:20,353 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 16:57:20,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:57:20,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867019817] [2022-02-20 16:57:20,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867019817] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:57:20,354 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:57:20,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:57:20,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338027043] [2022-02-20 16:57:20,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:57:20,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-02-20 16:57:20,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:57:20,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 16:57:20,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:57:20,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:57:20,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:57:20,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:57:20,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:57:20,367 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 16:57:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:57:20,407 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:57:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:57:20,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-02-20 16:57:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:57:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 16:57:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 16:57:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 16:57:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 16:57:20,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-02-20 16:57:20,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:57:20,434 INFO L225 Difference]: With dead ends: 22 [2022-02-20 16:57:20,434 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:57:20,437 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 16:57:20,441 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:57:20,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:57:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:57:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:57:20,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:57:20,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 16:57:20,443 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 16:57:20,443 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 16:57:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:57:20,444 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:57:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:57:20,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:57:20,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:57:20,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:57:20,444 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:57:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:57:20,445 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:57:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:57:20,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:57:20,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:57:20,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:57:20,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:57:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 16:57:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:57:20,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-02-20 16:57:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:57:20,446 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:57:20,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 16:57:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:57:20,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:57:20,449 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 16:57:20,449 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 16:57:20,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:57:20,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:57:20,465 INFO L858 garLoopResultBuilder]: For program point L609(lines 609 610) no Hoare annotation was computed. [2022-02-20 16:57:20,465 INFO L858 garLoopResultBuilder]: For program point L609-2(lines 609 610) no Hoare annotation was computed. [2022-02-20 16:57:20,465 INFO L858 garLoopResultBuilder]: For program point L605(line 605) no Hoare annotation was computed. [2022-02-20 16:57:20,465 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 610) no Hoare annotation was computed. [2022-02-20 16:57:20,465 INFO L858 garLoopResultBuilder]: For program point L597(line 597) no Hoare annotation was computed. [2022-02-20 16:57:20,466 INFO L858 garLoopResultBuilder]: For program point L597-2(line 597) no Hoare annotation was computed. [2022-02-20 16:57:20,466 INFO L861 garLoopResultBuilder]: At program point L589(lines 580 590) the Hoare annotation is: true [2022-02-20 16:57:20,466 INFO L861 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: true [2022-02-20 16:57:20,466 INFO L858 garLoopResultBuilder]: For program point L610(line 610) no Hoare annotation was computed. [2022-02-20 16:57:20,466 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:57:20,466 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:57:20,466 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:57:20,466 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 605) no Hoare annotation was computed. [2022-02-20 16:57:20,467 INFO L858 garLoopResultBuilder]: For program point L582-1(lines 582 588) no Hoare annotation was computed. [2022-02-20 16:57:20,467 INFO L858 garLoopResultBuilder]: For program point L582-3(lines 582 588) no Hoare annotation was computed. [2022-02-20 16:57:20,467 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:57:20,467 INFO L858 garLoopResultBuilder]: For program point L603-1(lines 591 613) no Hoare annotation was computed. [2022-02-20 16:57:20,467 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 613) no Hoare annotation was computed. [2022-02-20 16:57:20,467 INFO L861 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: true [2022-02-20 16:57:20,467 INFO L861 garLoopResultBuilder]: At program point L587-1(lines 582 588) the Hoare annotation is: true [2022-02-20 16:57:20,467 INFO L858 garLoopResultBuilder]: For program point L608-1(lines 591 613) no Hoare annotation was computed. [2022-02-20 16:57:20,468 INFO L858 garLoopResultBuilder]: For program point L604(lines 604 605) no Hoare annotation was computed. [2022-02-20 16:57:20,468 INFO L858 garLoopResultBuilder]: For program point L604-2(lines 604 605) no Hoare annotation was computed. [2022-02-20 16:57:20,468 INFO L854 garLoopResultBuilder]: At program point L596-2(lines 596 602) the Hoare annotation is: (and (= |ULTIMATE.start_main_~high~0#1.base| 0) (= |ULTIMATE.start_main_~high~0#1.offset| 0) (= |ULTIMATE.start_main_~low~0#1.offset| 0) (= |ULTIMATE.start_main_~low~0#1.base| 0)) [2022-02-20 16:57:20,468 INFO L858 garLoopResultBuilder]: For program point L584(lines 584 587) no Hoare annotation was computed. [2022-02-20 16:57:20,468 INFO L858 garLoopResultBuilder]: For program point append_to_listEXIT(lines 573 579) no Hoare annotation was computed. [2022-02-20 16:57:20,468 INFO L861 garLoopResultBuilder]: At program point append_to_listENTRY(lines 573 579) the Hoare annotation is: true [2022-02-20 16:57:20,468 INFO L858 garLoopResultBuilder]: For program point append_to_listFINAL(lines 573 579) no Hoare annotation was computed. [2022-02-20 16:57:20,472 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:57:20,473 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: append_to_listFINAL has no Hoare annotation [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: append_to_listFINAL has no Hoare annotation [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: L582-3 has no Hoare annotation [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: L582-1 has no Hoare annotation [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: append_to_listEXIT has no Hoare annotation [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: append_to_listEXIT has no Hoare annotation [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: L582-3 has no Hoare annotation [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: L582-1 has no Hoare annotation [2022-02-20 16:57:20,476 WARN L170 areAnnotationChecker]: L582-1 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L604 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L604 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2022-02-20 16:57:20,477 WARN L170 areAnnotationChecker]: L591 has no Hoare annotation [2022-02-20 16:57:20,478 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2022-02-20 16:57:20,478 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2022-02-20 16:57:20,478 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2022-02-20 16:57:20,478 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2022-02-20 16:57:20,478 WARN L170 areAnnotationChecker]: L604-2 has no Hoare annotation [2022-02-20 16:57:20,478 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:57:20,478 WARN L170 areAnnotationChecker]: L610 has no Hoare annotation [2022-02-20 16:57:20,478 WARN L170 areAnnotationChecker]: L610 has no Hoare annotation [2022-02-20 16:57:20,478 WARN L170 areAnnotationChecker]: L609-2 has no Hoare annotation [2022-02-20 16:57:20,478 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:57:20,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:57:20 BoogieIcfgContainer [2022-02-20 16:57:20,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:57:20,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:57:20,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:57:20,485 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:57:20,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:57:19" (3/4) ... [2022-02-20 16:57:20,488 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:57:20,497 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure append_to_list [2022-02-20 16:57:20,500 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 16:57:20,500 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 16:57:20,500 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:57:20,500 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:57:20,522 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:57:20,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:57:20,522 INFO L158 Benchmark]: Toolchain (without parser) took 1586.27ms. Allocated memory was 111.1MB in the beginning and 153.1MB in the end (delta: 41.9MB). Free memory was 78.9MB in the beginning and 65.5MB in the end (delta: 13.4MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2022-02-20 16:57:20,523 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:57:20,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.36ms. Allocated memory is still 111.1MB. Free memory was 78.9MB in the beginning and 76.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:57:20,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.83ms. Allocated memory is still 111.1MB. Free memory was 76.6MB in the beginning and 74.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:57:20,523 INFO L158 Benchmark]: Boogie Preprocessor took 21.76ms. Allocated memory is still 111.1MB. Free memory was 74.5MB in the beginning and 72.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:57:20,523 INFO L158 Benchmark]: RCFGBuilder took 327.68ms. Allocated memory is still 111.1MB. Free memory was 72.8MB in the beginning and 57.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:57:20,524 INFO L158 Benchmark]: TraceAbstraction took 848.56ms. Allocated memory was 111.1MB in the beginning and 153.1MB in the end (delta: 41.9MB). Free memory was 56.2MB in the beginning and 67.6MB in the end (delta: -11.4MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2022-02-20 16:57:20,524 INFO L158 Benchmark]: Witness Printer took 36.39ms. Allocated memory is still 153.1MB. Free memory was 67.6MB in the beginning and 65.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:57:20,525 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.15ms. Allocated memory is still 111.1MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.36ms. Allocated memory is still 111.1MB. Free memory was 78.9MB in the beginning and 76.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.83ms. Allocated memory is still 111.1MB. Free memory was 76.6MB in the beginning and 74.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.76ms. Allocated memory is still 111.1MB. Free memory was 74.5MB in the beginning and 72.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 327.68ms. Allocated memory is still 111.1MB. Free memory was 72.8MB in the beginning and 57.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 848.56ms. Allocated memory was 111.1MB in the beginning and 153.1MB in the end (delta: 41.9MB). Free memory was 56.2MB in the beginning and 67.6MB in the end (delta: -11.4MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Witness Printer took 36.39ms. Allocated memory is still 153.1MB. Free memory was 67.6MB in the beginning and 65.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 - PositiveResult [Line: 605]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 610]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 78 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 7 PreInvPairs, 9 NumberOfFragments, 18 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 57 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: ((high == 0 && high == 0) && low == 0) && low == 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:57:20,565 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 Result: TRUE