./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/packet_filter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/packet_filter.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:05:09,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:05:09,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:05:09,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:05:09,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:05:09,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:05:09,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:05:09,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:05:09,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:05:09,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:05:09,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:05:09,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:05:09,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:05:09,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:05:09,251 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:05:09,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:05:09,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:05:09,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:05:09,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:05:09,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:05:09,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:05:09,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:05:09,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:05:09,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:05:09,253 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:05:09,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:05:09,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:05:09,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:05:09,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:05:09,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:05:09,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:05:09,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:05:09,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:09,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:05:09,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:05:09,254 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:05:09,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:05:09,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:05:09,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:05:09,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:05:09,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:05:09,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:05:09,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:05:09,255 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 ! 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 -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2025-02-07 20:05:09,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:05:09,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:05:09,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:05:09,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:05:09,588 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:05:09,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2025-02-07 20:05:10,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32dc0f1d6/5c40ab1f843b425abfe3598ca851c55d/FLAG0a747a366 [2025-02-07 20:05:11,324 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:05:11,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2025-02-07 20:05:11,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32dc0f1d6/5c40ab1f843b425abfe3598ca851c55d/FLAG0a747a366 [2025-02-07 20:05:11,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32dc0f1d6/5c40ab1f843b425abfe3598ca851c55d [2025-02-07 20:05:11,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:05:11,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:05:11,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:11,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:05:11,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:05:11,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11, skipping insertion in model container [2025-02-07 20:05:11,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:05:11,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2025-02-07 20:05:11,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2025-02-07 20:05:11,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:11,725 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:05:11,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2025-02-07 20:05:11,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2025-02-07 20:05:11,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:11,817 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:05:11,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11 WrapperNode [2025-02-07 20:05:11,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:11,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:11,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:05:11,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:05:11,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,850 INFO L138 Inliner]: procedures = 130, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2025-02-07 20:05:11,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:11,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:05:11,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:05:11,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:05:11,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,898 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 6, 6, 16, 6, 6, 15]. 28 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 2, 0, 0, 0, 3]. The 14 writes are split as follows [0, 3, 1, 4, 3, 3, 0]. [2025-02-07 20:05:11,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:05:11,922 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:05:11,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:05:11,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:05:11,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (1/1) ... [2025-02-07 20:05:11,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:11,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:11,956 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-07 20:05:11,959 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-07 20:05:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:05:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 20:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 20:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 20:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 20:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 20:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:05:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 20:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 20:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 20:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 20:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 20:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2025-02-07 20:05:11,980 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2025-02-07 20:05:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 20:05:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure send [2025-02-07 20:05:11,982 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 20:05:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:05:11,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:05:12,124 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:05:12,127 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:05:12,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L587: havoc receive_#t~mem6#1;havoc receive_#t~mem7#1;havoc receive_#t~mem8#1.base, receive_#t~mem8#1.offset;call ULTIMATE.dealloc(receive_~#packet~0#1.base, receive_~#packet~0#1.offset);havoc receive_~#packet~0#1.base, receive_~#packet~0#1.offset;main_#t~ret32#1.size, main_#t~ret32#1.prio, main_#t~ret32#1.payload.base, main_#t~ret32#1.payload.offset := receive_#res#1.size, receive_#res#1.prio, receive_#res#1.payload.base, receive_#res#1.payload.offset;havoc receive_#t~nondet3#1, receive_#t~nondet4#1, receive_#t~nondet5#1.base, receive_#t~nondet5#1.offset, receive_#t~mem6#1, receive_#t~mem7#1, receive_#t~mem8#1.base, receive_#t~mem8#1.offset, receive_~#packet~0#1.base, receive_~#packet~0#1.offset;assume { :end_inline_receive } true;call write~init~int#6(main_#t~ret32#1.size, main_~#new_packet~0#1.base, main_~#new_packet~0#1.offset, 4);call write~init~int#6(main_#t~ret32#1.prio, main_~#new_packet~0#1.base, 4 + main_~#new_packet~0#1.offset, 4);call write~init~$Pointer$#6(main_#t~ret32#1.payload.base, main_#t~ret32#1.payload.offset, main_~#new_packet~0#1.base, 8 + main_~#new_packet~0#1.offset, 4);havoc main_#t~ret32#1.size, main_#t~ret32#1.prio, main_#t~ret32#1.payload.base, main_#t~ret32#1.payload.offset;call main_#t~mem33#1 := read~int#6(main_~#new_packet~0#1.base, main_~#new_packet~0#1.offset, 4); [2025-02-07 20:05:12,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L618: assume main_#t~mem38#1 % 4294967296 < 500;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int#6(main_~#new_packet~0#1.base, main_~#new_packet~0#1.offset, 4);call main_#t~mem40#1 := read~int#6(main_~#new_packet~0#1.base, 4 + main_~#new_packet~0#1.offset, 4);call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$#6(main_~#new_packet~0#1.base, 8 + main_~#new_packet~0#1.offset, 4); [2025-02-07 20:05:12,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L618: assume !(main_#t~mem38#1 % 4294967296 < 500);havoc main_#t~mem38#1;call main_#t~mem42#1 := read~int#6(main_~#new_packet~0#1.base, main_~#new_packet~0#1.offset, 4);call main_#t~mem43#1 := read~int#6(main_~#new_packet~0#1.base, 4 + main_~#new_packet~0#1.offset, 4);call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$#6(main_~#new_packet~0#1.base, 8 + main_~#new_packet~0#1.offset, 4); [2025-02-07 20:05:12,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: assume 1 == main_#t~mem34#1 % 4294967296;havoc main_#t~mem34#1;call main_#t~mem35#1 := read~int#6(main_~#new_packet~0#1.base, main_~#new_packet~0#1.offset, 4);call main_#t~mem36#1 := read~int#6(main_~#new_packet~0#1.base, 4 + main_~#new_packet~0#1.offset, 4);call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$#6(main_~#new_packet~0#1.base, 8 + main_~#new_packet~0#1.offset, 4); [2025-02-07 20:05:12,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: assume !(1 == main_#t~mem34#1 % 4294967296);havoc main_#t~mem34#1;call main_#t~mem38#1 := read~int#6(main_~#new_packet~0#1.base, main_~#new_packet~0#1.offset, 4); [2025-02-07 20:05:12,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: call ULTIMATE.dealloc(main_~#new_packet~0#1.base, main_~#new_packet~0#1.offset);havoc main_~#new_packet~0#1.base, main_~#new_packet~0#1.offset;havoc main_~#new_packet~0#1.base, main_~#new_packet~0#1.offset; [2025-02-07 20:05:12,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: havoc main_#t~mem42#1;havoc main_#t~mem43#1;havoc main_#t~mem44#1.base, main_#t~mem44#1.offset; [2025-02-07 20:05:12,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L621-1: SUMMARY for call append_to_queue(main_#t~mem42#1, main_#t~mem43#1, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~#normal_queue~0#1.base, main_~#normal_queue~0#1.offset); srcloc: null [2025-02-07 20:05:12,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: havoc main_#t~mem39#1;havoc main_#t~mem40#1;havoc main_#t~mem41#1.base, main_#t~mem41#1.offset; [2025-02-07 20:05:12,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L619-1: SUMMARY for call append_to_queue(main_#t~mem39#1, main_#t~mem40#1, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_~#prio_queue~0#1.base, main_~#prio_queue~0#1.offset); srcloc: null [2025-02-07 20:05:12,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L617: havoc main_#t~mem35#1;havoc main_#t~mem36#1;havoc main_#t~mem37#1.base, main_#t~mem37#1.offset; [2025-02-07 20:05:12,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L617-1: SUMMARY for call append_to_queue(main_#t~mem35#1, main_#t~mem36#1, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~#prio_queue~0#1.base, main_~#prio_queue~0#1.offset); srcloc: null [2025-02-07 20:05:12,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: assume main_#t~mem33#1 % 4294967296 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int#6(main_~#new_packet~0#1.base, 4 + main_~#new_packet~0#1.offset, 4); [2025-02-07 20:05:12,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: assume !(main_#t~mem33#1 % 4294967296 > 0);havoc main_#t~mem33#1; [2025-02-07 20:05:12,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: call ULTIMATE.dealloc(main_~#prio_queue~0#1.base, main_~#prio_queue~0#1.offset);havoc main_~#prio_queue~0#1.base, main_~#prio_queue~0#1.offset;call ULTIMATE.dealloc(main_~#normal_queue~0#1.base, main_~#normal_queue~0#1.offset);havoc main_~#normal_queue~0#1.base, main_~#normal_queue~0#1.offset; [2025-02-07 20:05:12,419 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-07 20:05:12,419 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:05:12,431 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:05:12,431 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:05:12,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:12 BoogieIcfgContainer [2025-02-07 20:05:12,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:05:12,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:05:12,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:05:12,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:05:12,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:05:11" (1/3) ... [2025-02-07 20:05:12,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b76f6d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:12, skipping insertion in model container [2025-02-07 20:05:12,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:11" (2/3) ... [2025-02-07 20:05:12,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b76f6d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:12, skipping insertion in model container [2025-02-07 20:05:12,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:12" (3/3) ... [2025-02-07 20:05:12,443 INFO L128 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2025-02-07 20:05:12,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:05:12,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG packet_filter.i that has 3 procedures, 30 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-02-07 20:05:12,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:05:12,513 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=LoopHeads, 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;@273b49a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:05:12,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 20:05:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 20 states have (on average 1.5) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:05:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:05:12,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:12,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:12,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1219957370, now seen corresponding path program 1 times [2025-02-07 20:05:12,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-02-07 20:05:12,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:12,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:05:12,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:05:12,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:12,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:12,661 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-07 20:05:12,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:12,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-02-07 20:05:12,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395695518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:12,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:12,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:05:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861111008] [2025-02-07 20:05:12,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:12,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:05:12,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:12,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:05:12,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:05:12,687 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.5) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:12,702 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2025-02-07 20:05:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:05:12,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 20:05:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:12,710 INFO L225 Difference]: With dead ends: 50 [2025-02-07 20:05:12,710 INFO L226 Difference]: Without dead ends: 23 [2025-02-07 20:05:12,714 INFO L434 NwaCegarLoop]: 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 [2025-02-07 20:05:12,717 INFO L435 NwaCegarLoop]: 31 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, 31 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 [2025-02-07 20:05:12,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-07 20:05:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-07 20:05:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:05:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-02-07 20:05:12,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 7 [2025-02-07 20:05:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:12,752 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-02-07 20:05:12,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-02-07 20:05:12,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:05:12,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:12,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:12,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:05:12,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:12,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1207221078, now seen corresponding path program 1 times [2025-02-07 20:05:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502997662] [2025-02-07 20:05:12,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:12,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:05:12,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:05:12,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:12,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:12,987 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-07 20:05:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502997662] [2025-02-07 20:05:12,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502997662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:12,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:12,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:05:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452200728] [2025-02-07 20:05:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:12,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:05:12,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:12,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:05:12,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:05:12,993 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:13,007 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-02-07 20:05:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:05:13,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-07 20:05:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:13,008 INFO L225 Difference]: With dead ends: 35 [2025-02-07 20:05:13,008 INFO L226 Difference]: Without dead ends: 16 [2025-02-07 20:05:13,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:05:13,009 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 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-07 20:05:13,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-07 20:05:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-07 20:05:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-02-07 20:05:13,015 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2025-02-07 20:05:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:13,015 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-02-07 20:05:13,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-02-07 20:05:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:05:13,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:13,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:13,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:05:13,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:13,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1221340931, now seen corresponding path program 1 times [2025-02-07 20:05:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:13,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384588570] [2025-02-07 20:05:13,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:13,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:13,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:05:13,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:05:13,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:13,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:13,194 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-07 20:05:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384588570] [2025-02-07 20:05:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384588570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:13,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:13,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:05:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309641721] [2025-02-07 20:05:13,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:13,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:05:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:13,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:05:13,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:05:13,197 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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) [2025-02-07 20:05:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:13,207 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-02-07 20:05:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:05:13,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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 [2025-02-07 20:05:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:13,207 INFO L225 Difference]: With dead ends: 17 [2025-02-07 20:05:13,207 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:05:13,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:05:13,208 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:13,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:05:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:05:13,209 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) [2025-02-07 20:05:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:05:13,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2025-02-07 20:05:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:13,209 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:05:13,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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) [2025-02-07 20:05:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:05:13,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:05:13,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 20:05:13,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 20:05:13,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:05:13,217 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-07 20:05:13,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:05:13,264 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:05:13,274 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-07 20:05:13,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-07 20:05:13,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#normal_queue~0!base,]]] [2025-02-07 20:05:13,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~node~1!offset [2025-02-07 20:05:13,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-07 20:05:13,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-07 20:05:13,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#normal_queue~0!base,]]] [2025-02-07 20:05:13,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~node~1!base [2025-02-07 20:05:13,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~node~2!offset [2025-02-07 20:05:13,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~node~2!base [2025-02-07 20:05:13,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-07 20:05:13,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-07 20:05:13,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#prio_queue~0!base,]]] [2025-02-07 20:05:13,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-07 20:05:13,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-07 20:05:13,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#normal_queue~0!base,]]] [2025-02-07 20:05:13,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-07 20:05:13,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-07 20:05:13,278 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#normal_queue~0!base,]]] [2025-02-07 20:05:13,278 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-07 20:05:13,278 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-07 20:05:13,278 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#prio_queue~0!base,]]] [2025-02-07 20:05:13,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:05:13 BoogieIcfgContainer [2025-02-07 20:05:13,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:05:13,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:05:13,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:05:13,281 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:05:13,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:12" (3/4) ... [2025-02-07 20:05:13,283 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:05:13,286 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure append_to_queue [2025-02-07 20:05:13,286 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure send [2025-02-07 20:05:13,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-07 20:05:13,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 20:05:13,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 20:05:13,292 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:05:13,377 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:05:13,380 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:05:13,380 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:05:13,381 INFO L158 Benchmark]: Toolchain (without parser) took 2017.81ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 103.7MB in the end (delta: 17.6MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2025-02-07 20:05:13,381 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:05:13,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.86ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 102.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:05:13,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.95ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 100.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:05:13,382 INFO L158 Benchmark]: Boogie Preprocessor took 68.84ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 97.7MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:05:13,382 INFO L158 Benchmark]: IcfgBuilder took 509.27ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 75.3MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:05:13,382 INFO L158 Benchmark]: TraceAbstraction took 845.65ms. Allocated memory is still 167.8MB. Free memory was 75.0MB in the beginning and 109.7MB in the end (delta: -34.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:05:13,382 INFO L158 Benchmark]: Witness Printer took 100.02ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 103.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:05:13,387 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.20ms. Allocated memory is still 201.3MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.86ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 102.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.95ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 100.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.84ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 97.7MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 509.27ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 75.3MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 845.65ms. Allocated memory is still 167.8MB. Free memory was 75.0MB in the beginning and 109.7MB in the end (delta: -34.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 100.02ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 103.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#normal_queue~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~node~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#normal_queue~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~node~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~node~2!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~node~2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#prio_queue~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#normal_queue~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#normal_queue~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#prio_queue~0!base,]]] * 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: 606]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 599]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 10, 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: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 131 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 20:05:13,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE