./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-examples/relax-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-examples/relax-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fcae0c4d0ca1fc30eac1578cd8b45001717e96b8c9c5f68d5df56e6c4fcd72c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:11:32,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:11:32,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:11:32,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:11:32,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:11:32,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:11:32,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:11:32,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:11:32,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:11:32,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:11:32,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:11:32,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:11:32,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:11:32,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:11:32,528 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:11:32,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:11:32,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:11:32,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:11:32,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:11:32,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:11:32,529 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:11:32,529 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:11:32,529 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:11:32,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:11:32,529 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:11:32,529 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:11:32,529 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:11:32,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:11:32,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:11:32,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:11:32,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:11:32,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:11:32,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:11:32,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:11:32,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:11:32,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:11:32,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:11:32,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:11:32,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:11:32,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:11:32,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:11:32,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:11:32,531 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fcae0c4d0ca1fc30eac1578cd8b45001717e96b8c9c5f68d5df56e6c4fcd72c [2025-02-08 06:11:32,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:11:32,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:11:32,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:11:32,746 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:11:32,746 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:11:32,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/relax-1.i [2025-02-08 06:11:33,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00c0db09b/c31809dd50794e4eb0ce709050de2733/FLAG9f2c69e98 [2025-02-08 06:11:34,181 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:11:34,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/relax-1.i [2025-02-08 06:11:34,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00c0db09b/c31809dd50794e4eb0ce709050de2733/FLAG9f2c69e98 [2025-02-08 06:11:34,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00c0db09b/c31809dd50794e4eb0ce709050de2733 [2025-02-08 06:11:34,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:11:34,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:11:34,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:11:34,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:11:34,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:11:34,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470f36e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34, skipping insertion in model container [2025-02-08 06:11:34,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:11:34,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:11:34,441 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:11:34,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:11:34,491 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:11:34,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34 WrapperNode [2025-02-08 06:11:34,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:11:34,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:11:34,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:11:34,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:11:34,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,524 INFO L138 Inliner]: procedures = 120, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 127 [2025-02-08 06:11:34,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:11:34,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:11:34,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:11:34,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:11:34,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,547 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-02-08 06:11:34,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:11:34,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:11:34,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:11:34,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:11:34,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (1/1) ... [2025-02-08 06:11:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:11:34,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:34,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:11:34,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:11:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:11:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:11:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:11:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 06:11:34,614 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 06:11:34,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:11:34,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:11:34,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:11:34,614 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 06:11:34,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 06:11:34,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:11:34,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:11:34,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:11:34,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:11:34,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:11:34,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:11:34,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:11:34,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:11:34,712 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:11:34,713 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:11:34,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630: havoc main_~differences~0#1; [2025-02-08 06:11:34,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: assume #valid == main_old_#valid#1;assume #valid == main_old_#valid#1;#t~ret26#1 := main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~ret10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_~i~1#1, main_~different~0#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~pre23#1, main_#t~post24#1, main_~i~2#1, main_#t~pre25#1, main_~differences~0#1, main_~pat_len~0#1, main_~a_len~0#1, main_~pat~0#1.base, main_~pat~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;assume { :end_inline_main } true; [2025-02-08 06:11:34,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: assume !(#valid == main_old_#valid#1); [2025-02-08 06:11:34,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L630-1: SUMMARY for call __VERIFIER_assert((if main_~differences~0#1 % 4294967296 > 1 then 1 else 0)); srcloc: null [2025-02-08 06:11:34,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: assume main_~i~1#1 % 4294967296 == main_~different~0#1 % 4294967296; [2025-02-08 06:11:34,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: assume !(main_~i~1#1 % 4294967296 == main_~different~0#1 % 4294967296); [2025-02-08 06:11:34,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610: havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; [2025-02-08 06:11:34,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610-1: SUMMARY for call write~int#1(main_#t~nondet12#1, main_~pat~0#1.base, main_~pat~0#1.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 06:11:34,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610-1: assume !(1 == #valid[main_~pat~0#1.base]); [2025-02-08 06:11:34,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L610-1: assume !(4 + (main_~pat~0#1.offset + 4 * main_~i~1#1) <= #length[main_~pat~0#1.base] && 0 <= main_~pat~0#1.offset + 4 * main_~i~1#1); [2025-02-08 06:11:34,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L606: assume main_~pat_len~0#1 % 4294967296 > main_~a_len~0#1 % 4294967296;main_~different~0#1 := main_~pat_len~0#1 - 1; [2025-02-08 06:11:34,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L606: assume !(main_~pat_len~0#1 % 4294967296 > main_~a_len~0#1 % 4294967296); [2025-02-08 06:11:34,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-08 06:11:34,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L602: assume 0 != main_#t~ret10#1 % 256;havoc main_#t~ret10#1; [2025-02-08 06:11:34,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L602: assume !(0 != main_#t~ret10#1 % 256);havoc main_#t~ret10#1; [2025-02-08 06:11:34,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L602-1: main_#t~ret10#1 := is_relaxed_prefix_#res#1;havoc is_relaxed_prefix_#t~mem3#1, is_relaxed_prefix_#t~mem4#1, is_relaxed_prefix_#t~post5#1, is_relaxed_prefix_~i~0#1, is_relaxed_prefix_~pat#1.base, is_relaxed_prefix_~pat#1.offset, is_relaxed_prefix_~pat_length#1, is_relaxed_prefix_~a#1.base, is_relaxed_prefix_~a#1.offset, is_relaxed_prefix_~a_length#1, is_relaxed_prefix_~shift~0#1;havoc is_relaxed_prefix_#in~pat#1.base, is_relaxed_prefix_#in~pat#1.offset, is_relaxed_prefix_#in~pat_length#1, is_relaxed_prefix_#in~a#1.base, is_relaxed_prefix_#in~a#1.offset, is_relaxed_prefix_#in~a_length#1;assume { :end_inline_is_relaxed_prefix } true; [2025-02-08 06:11:34,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: assume main_~i~2#1 % 4294967296 < main_~pat_len~0#1 % 4294967296 && main_~i~2#1 % 4294967296 < main_~a_len~0#1 % 4294967296; [2025-02-08 06:11:34,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: assume !(main_~i~2#1 % 4294967296 < main_~pat_len~0#1 % 4294967296 && main_~i~2#1 % 4294967296 < main_~a_len~0#1 % 4294967296);havoc main_~i~2#1; [2025-02-08 06:11:34,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L623-1: main_#t~post24#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; [2025-02-08 06:11:34,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: SUMMARY for call assume_abort_if_not((if main_#t~mem16#1 != main_#t~mem17#1 then 1 else 0)); srcloc: null [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-1: SUMMARY for call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-1: assume !(1 == #valid[main_~a~0#1.base]); [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-1: assume !(4 + (main_~a~0#1.offset + 4 * main_~i~1#1) <= #length[main_~a~0#1.base] && 0 <= main_~a~0#1.offset + 4 * main_~i~1#1); [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-2: SUMMARY for call main_#t~mem16#1 := read~int#1(main_~pat~0#1.base, main_~pat~0#1.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-2: assume !(1 == #valid[main_~pat~0#1.base]); [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-2: assume !(4 + (main_~pat~0#1.offset + 4 * main_~i~1#1) <= #length[main_~pat~0#1.base] && 0 <= main_~pat~0#1.offset + 4 * main_~i~1#1); [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc main_#t~nondet13#1; [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L611-1: SUMMARY for call write~int#2(main_#t~nondet13#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L611-1: assume !(1 == #valid[main_~a~0#1.base]); [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L611-1: assume !(4 + (main_~a~0#1.offset + 4 * main_~i~1#1) <= #length[main_~a~0#1.base] && 0 <= main_~a~0#1.offset + 4 * main_~i~1#1); [2025-02-08 06:11:34,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L632: assume 0 == main_~pat~0#1.base || 1 == #valid[main_~pat~0#1.base];call ULTIMATE.dealloc(main_~pat~0#1.base, main_~pat~0#1.offset); [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L632: assume !(0 == main_~pat~0#1.base || 1 == #valid[main_~pat~0#1.base]); [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L632-1: assume main_~pat~0#1.base < #StackHeapBarrier; [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L632-1: assume !(main_~pat~0#1.base < #StackHeapBarrier); [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L632-2: assume 0 == main_~pat~0#1.offset; [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L632-2: assume !(0 == main_~pat~0#1.offset); [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: assume main_~pat_len~0#1 % 4294967296 > main_~a_len~0#1 % 4294967296;main_#t~pre25#1 := 1 + main_~differences~0#1;main_~differences~0#1 := 1 + main_~differences~0#1; [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: assume !(main_~pat_len~0#1 % 4294967296 > main_~a_len~0#1 % 4294967296); [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: assume main_~pat_len~0#1 % 4294967296 <= (1 + main_~a_len~0#1) % 4294967296;main_~differences~0#1 := 0;main_~i~2#1 := 0; [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: assume !(main_~pat_len~0#1 % 4294967296 <= (1 + main_~a_len~0#1) % 4294967296); [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: assume main_~i~1#1 % 4294967296 > main_~different~0#1 % 4294967296; [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: assume !(main_~i~1#1 % 4294967296 > main_~different~0#1 % 4294967296); [2025-02-08 06:11:34,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L612: assume main_~i~1#1 % 4294967296 < main_~different~0#1 % 4294967296; [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L612: assume !(main_~i~1#1 % 4294967296 < main_~different~0#1 % 4294967296); [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: assume main_~i~1#1 % 4294967296 < main_~pat_len~0#1 % 4294967296 && main_~i~1#1 % 4294967296 < main_~a_len~0#1 % 4294967296;havoc main_#t~nondet12#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: assume !(main_~i~1#1 % 4294967296 < main_~pat_len~0#1 % 4294967296 && main_~i~1#1 % 4294967296 < main_~a_len~0#1 % 4294967296);havoc main_~i~1#1;havoc main_~different~0#1; [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L608-1: main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L608-2: main_~i~1#1 := 0; [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: havoc main_#t~nondet11#1;main_~different~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L604-1: SUMMARY for call __VERIFIER_assert((if main_~pat_len~0#1 % 4294967296 <= (1 + main_~a_len~0#1) % 4294967296 then 1 else 0)); srcloc: null [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L633: assume 0 == main_~a~0#1.base || 1 == #valid[main_~a~0#1.base];call ULTIMATE.dealloc(main_~a~0#1.base, main_~a~0#1.offset);main_#res#1 := 0; [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L633: assume !(0 == main_~a~0#1.base || 1 == #valid[main_~a~0#1.base]); [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L633-1: assume main_~a~0#1.base < #StackHeapBarrier; [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L633-1: assume !(main_~a~0#1.base < #StackHeapBarrier); [2025-02-08 06:11:34,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L633-2: assume 0 == main_~a~0#1.offset; [2025-02-08 06:11:34,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L633-2: assume !(0 == main_~a~0#1.offset); [2025-02-08 06:11:34,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: assume main_#t~mem21#1 != main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;main_#t~pre23#1 := 1 + main_~differences~0#1;main_~differences~0#1 := 1 + main_~differences~0#1; [2025-02-08 06:11:34,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: assume !(main_#t~mem21#1 != main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-1: SUMMARY for call main_#t~mem22#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset + 4 * (if (main_~i~2#1 - main_~differences~0#1) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~2#1 - main_~differences~0#1) % 4294967296 % 4294967296 else (main_~i~2#1 - main_~differences~0#1) % 4294967296 % 4294967296 - 4294967296), 4); srcloc: null [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-1: assume !(1 == #valid[main_~a~0#1.base]); [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-1: assume !(4 + (main_~a~0#1.offset + 4 * (if (main_~i~2#1 - main_~differences~0#1) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~2#1 - main_~differences~0#1) % 4294967296 % 4294967296 else (main_~i~2#1 - main_~differences~0#1) % 4294967296 % 4294967296 - 4294967296)) <= #length[main_~a~0#1.base] && 0 <= main_~a~0#1.offset + 4 * (if (main_~i~2#1 - main_~differences~0#1) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~2#1 - main_~differences~0#1) % 4294967296 % 4294967296 else (main_~i~2#1 - main_~differences~0#1) % 4294967296 % 4294967296 - 4294967296)); [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-2: SUMMARY for call main_#t~mem21#1 := read~int#1(main_~pat~0#1.base, main_~pat~0#1.offset + 4 * main_~i~2#1, 4); srcloc: null [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-2: assume !(1 == #valid[main_~pat~0#1.base]); [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-2: assume !(4 + (main_~pat~0#1.offset + 4 * main_~i~2#1) <= #length[main_~pat~0#1.base] && 0 <= main_~pat~0#1.offset + 4 * main_~i~2#1); [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L617: SUMMARY for call __VERIFIER_assert((if main_#t~mem18#1 == main_#t~mem19#1 then 1 else 0)); srcloc: null [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L617-1: SUMMARY for call main_#t~mem19#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset + 4 * (main_~i~1#1 - 1), 4); srcloc: null [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L617-1: assume !(1 == #valid[main_~a~0#1.base]); [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L617-1: assume !(4 + (main_~a~0#1.offset + 4 * (main_~i~1#1 - 1)) <= #length[main_~a~0#1.base] && 0 <= main_~a~0#1.offset + 4 * (main_~i~1#1 - 1)); [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L617-2: SUMMARY for call main_#t~mem18#1 := read~int#1(main_~pat~0#1.base, main_~pat~0#1.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L617-2: assume !(1 == #valid[main_~pat~0#1.base]); [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L617-2: assume !(4 + (main_~pat~0#1.offset + 4 * main_~i~1#1) <= #length[main_~pat~0#1.base] && 0 <= main_~pat~0#1.offset + 4 * main_~i~1#1); [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: SUMMARY for call assume_abort_if_not((if main_#t~mem14#1 == main_#t~mem15#1 then 1 else 0)); srcloc: null [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613-1: SUMMARY for call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613-1: assume !(1 == #valid[main_~a~0#1.base]); [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613-1: assume !(4 + (main_~a~0#1.offset + 4 * main_~i~1#1) <= #length[main_~a~0#1.base] && 0 <= main_~a~0#1.offset + 4 * main_~i~1#1); [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613-2: SUMMARY for call main_#t~mem14#1 := read~int#1(main_~pat~0#1.base, main_~pat~0#1.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 06:11:34,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613-2: assume !(1 == #valid[main_~pat~0#1.base]); [2025-02-08 06:11:34,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613-2: assume !(4 + (main_~pat~0#1.offset + 4 * main_~i~1#1) <= #length[main_~pat~0#1.base] && 0 <= main_~pat~0#1.offset + 4 * main_~i~1#1); [2025-02-08 06:11:35,017 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-02-08 06:11:35,017 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:11:35,024 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:11:35,024 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:11:35,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:11:35 BoogieIcfgContainer [2025-02-08 06:11:35,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:11:35,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:11:35,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:11:35,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:11:35,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:11:34" (1/3) ... [2025-02-08 06:11:35,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a98b323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:11:35, skipping insertion in model container [2025-02-08 06:11:35,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:34" (2/3) ... [2025-02-08 06:11:35,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a98b323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:11:35, skipping insertion in model container [2025-02-08 06:11:35,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:11:35" (3/3) ... [2025-02-08 06:11:35,033 INFO L128 eAbstractionObserver]: Analyzing ICFG relax-1.i [2025-02-08 06:11:35,043 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:11:35,044 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG relax-1.i that has 3 procedures, 27 locations, 1 initial locations, 3 loop locations, and 32 error locations. [2025-02-08 06:11:35,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:11:35,085 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@635098a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:11:35,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-08 06:11:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 2.0) internal successors, (18), 13 states have internal predecessors, (18), 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) [2025-02-08 06:11:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:11:35,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:35,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:11:35,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 29 more)] === [2025-02-08 06:11:35,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:35,096 INFO L85 PathProgramCache]: Analyzing trace with hash 4123902, now seen corresponding path program 1 times [2025-02-08 06:11:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:35,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795593725] [2025-02-08 06:11:35,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:35,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:35,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:11:35,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:11:35,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:35,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795593725] [2025-02-08 06:11:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795593725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:35,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:35,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:11:35,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587958246] [2025-02-08 06:11:35,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:35,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:11:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:35,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:11:35,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:11:35,486 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 2.0) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2025-02-08 06:11:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:35,502 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2025-02-08 06:11:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:11:35,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-08 06:11:35,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:35,509 INFO L225 Difference]: With dead ends: 13 [2025-02-08 06:11:35,509 INFO L226 Difference]: Without dead ends: 11 [2025-02-08 06:11:35,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:11:35,514 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:35,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-08 06:11:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-08 06:11:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 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) [2025-02-08 06:11:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-02-08 06:11:35,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 4 [2025-02-08 06:11:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:35,543 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-02-08 06:11:35,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2025-02-08 06:11:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2025-02-08 06:11:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:11:35,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:35,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:11:35,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:11:35,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 29 more)] === [2025-02-08 06:11:35,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash 4123903, now seen corresponding path program 1 times [2025-02-08 06:11:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453985312] [2025-02-08 06:11:35,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:35,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:11:35,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:11:35,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:35,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 06:11:35,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 06:11:35,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:11:35,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:11:35,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:35,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 06:11:35,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 06:11:35,625 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 06:11:35,626 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 32 remaining) [2025-02-08 06:11:35,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (30 of 32 remaining) [2025-02-08 06:11:35,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (29 of 32 remaining) [2025-02-08 06:11:35,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (28 of 32 remaining) [2025-02-08 06:11:35,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (27 of 32 remaining) [2025-02-08 06:11:35,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (26 of 32 remaining) [2025-02-08 06:11:35,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (25 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (24 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2025-02-08 06:11:35,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2025-02-08 06:11:35,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2025-02-08 06:11:35,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2025-02-08 06:11:35,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2025-02-08 06:11:35,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2025-02-08 06:11:35,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2025-02-08 06:11:35,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 32 remaining) [2025-02-08 06:11:35,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:11:35,635 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 06:11:35,658 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:11:35,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:11:35 BoogieIcfgContainer [2025-02-08 06:11:35,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:11:35,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:11:35,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:11:35,663 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:11:35,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:11:35" (3/4) ... [2025-02-08 06:11:35,665 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 06:11:35,692 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-02-08 06:11:35,721 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:11:35,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:11:35,722 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:11:35,723 INFO L158 Benchmark]: Toolchain (without parser) took 1503.57ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 92.1MB in the end (delta: 19.4MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2025-02-08 06:11:35,723 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:11:35,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.13ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 93.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:11:35,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.55ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:11:35,725 INFO L158 Benchmark]: Boogie Preprocessor took 41.93ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:11:35,725 INFO L158 Benchmark]: IcfgBuilder took 455.18ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 67.5MB in the end (delta: 22.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:11:35,725 INFO L158 Benchmark]: TraceAbstraction took 634.70ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 97.3MB in the end (delta: -30.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:11:35,725 INFO L158 Benchmark]: Witness Printer took 59.20ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 92.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:11:35,726 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.13ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 93.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.55ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.93ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 455.18ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 67.5MB in the end (delta: 22.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 634.70ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 97.3MB in the end (delta: -30.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.20ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 92.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L599] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L599] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L600] int *pat=malloc(sizeof(int)*pat_len); [L601] int *a=malloc(sizeof(int)*a_len); [L602] CALL is_relaxed_prefix(pat, pat_len, a, a_len) [L579] COND FALSE !(pat_length>a_length+1) [L581] int shift=0; [L582] int i=0; VAL [a={-3:0}, a_length=-2, i=0, pat={-1:0}, pat_length=-3221225472, shift=0] [L582] COND TRUE i