./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-memsafety/list1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-memsafety/list1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:18:32,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:18:32,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:18:32,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:18:32,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:18:32,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:18:32,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:18:32,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:18:32,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:18:32,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:18:32,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:18:32,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:18:32,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:18:32,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:18:32,910 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:18:32,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:18:32,911 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:18:32,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:18:32,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:18:32,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:18:32,911 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:18:32,911 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:18:32,911 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:18:32,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:18:32,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:18:32,912 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:18:32,912 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:18:32,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:18:32,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:18:32,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:18:32,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:18:32,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:18:32,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:18:32,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:32,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:18:32,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:18:32,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:18:32,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:18:32,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:18:32,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:18:32,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:18:32,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:18:32,913 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/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 -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2025-03-04 10:18:33,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:18:33,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:18:33,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:18:33,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:18:33,194 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:18:33,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2025-03-04 10:18:34,329 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7df1216/503b58d19b384637bf6220ba73f4f2c9/FLAGfe9cb7cb9 [2025-03-04 10:18:34,671 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:18:34,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2025-03-04 10:18:34,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7df1216/503b58d19b384637bf6220ba73f4f2c9/FLAGfe9cb7cb9 [2025-03-04 10:18:34,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7df1216/503b58d19b384637bf6220ba73f4f2c9 [2025-03-04 10:18:34,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:18:34,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:18:34,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:34,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:18:34,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:18:34,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:34" (1/1) ... [2025-03-04 10:18:34,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fbcc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:34, skipping insertion in model container [2025-03-04 10:18:34,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:34" (1/1) ... [2025-03-04 10:18:34,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:18:35,249 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:18:35,255 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:18:35,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:35,269 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:18:35,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:35,338 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:18:35,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35 WrapperNode [2025-03-04 10:18:35,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:35,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:35,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:18:35,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:18:35,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,375 INFO L138 Inliner]: procedures = 264, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-03-04 10:18:35,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:35,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:18:35,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:18:35,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:18:35,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,409 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [8, 3]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 3 writes are split as follows [2, 1]. [2025-03-04 10:18:35,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:18:35,418 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:18:35,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:18:35,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:18:35,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (1/1) ... [2025-03-04 10:18:35,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:35,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:35,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:18:35,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:18:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:18:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:18:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:18:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:18:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:18:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:18:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:18:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:18:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:18:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2025-03-04 10:18:35,491 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2025-03-04 10:18:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure build [2025-03-04 10:18:35,491 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2025-03-04 10:18:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:18:35,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:18:35,492 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:18:35,589 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:18:35,591 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:18:35,734 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: havoc ~#list~0#1.base, ~#list~0#1.offset; [2025-03-04 10:18:35,735 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: SUMMARY for call ULTIMATE.dealloc(~#list~0#1.base, ~#list~0#1.offset); srcloc: null [2025-03-04 10:18:35,817 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:18:35,818 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:18:35,867 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:18:35,867 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:18:35,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:35 BoogieIcfgContainer [2025-03-04 10:18:35,868 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:18:35,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:18:35,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:18:35,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:18:35,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:18:34" (1/3) ... [2025-03-04 10:18:35,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45874fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:35, skipping insertion in model container [2025-03-04 10:18:35,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:35" (2/3) ... [2025-03-04 10:18:35,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45874fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:35, skipping insertion in model container [2025-03-04 10:18:35,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:35" (3/3) ... [2025-03-04 10:18:35,877 INFO L128 eAbstractionObserver]: Analyzing ICFG list1.i [2025-03-04 10:18:35,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:18:35,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list1.i that has 3 procedures, 70 locations, 1 initial locations, 2 loop locations, and 30 error locations. [2025-03-04 10:18:35,890 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:18:35,950 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:18:35,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 162 flow [2025-03-04 10:18:36,022 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2025-03-04 10:18:36,023 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:36,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 5/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 216 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2025-03-04 10:18:36,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 162 flow [2025-03-04 10:18:36,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 154 flow [2025-03-04 10:18:36,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:36,046 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;@182cff07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:36,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-04 10:18:36,049 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:36,049 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-04 10:18:36,049 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:18:36,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:36,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:18:36,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:36,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash 265879768, now seen corresponding path program 1 times [2025-03-04 10:18:36,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:36,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961867767] [2025-03-04 10:18:36,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:36,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:36,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:18:36,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:18:36,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:36,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:36,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961867767] [2025-03-04 10:18:36,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961867767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:36,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:36,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551026253] [2025-03-04 10:18:36,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:36,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:36,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:36,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:36,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:36,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2025-03-04 10:18:36,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-03-04 10:18:36,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:36,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2025-03-04 10:18:36,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:36,532 INFO L124 PetriNetUnfolderBase]: 25/148 cut-off events. [2025-03-04 10:18:36,533 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:18:36,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 148 events. 25/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 512 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 120. Up to 31 conditions per place. [2025-03-04 10:18:36,535 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-03-04 10:18:36,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 231 flow [2025-03-04 10:18:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2025-03-04 10:18:36,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-03-04 10:18:36,544 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 154 flow. Second operand 4 states and 212 transitions. [2025-03-04 10:18:36,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 231 flow [2025-03-04 10:18:36,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:36,550 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 159 flow [2025-03-04 10:18:36,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-03-04 10:18:36,556 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2025-03-04 10:18:36,556 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 159 flow [2025-03-04 10:18:36,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-03-04 10:18:36,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:36,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:18:36,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:18:36,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:36,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash 265879769, now seen corresponding path program 1 times [2025-03-04 10:18:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:36,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544520314] [2025-03-04 10:18:36,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:36,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:36,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:18:36,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:18:36,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:36,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:36,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544520314] [2025-03-04 10:18:36,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544520314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:36,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:36,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747182383] [2025-03-04 10:18:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:36,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:36,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:36,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:36,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:36,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2025-03-04 10:18:36,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-03-04 10:18:36,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:36,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2025-03-04 10:18:36,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:36,860 INFO L124 PetriNetUnfolderBase]: 24/130 cut-off events. [2025-03-04 10:18:36,860 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 10:18:36,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 130 events. 24/130 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 410 event pairs, 8 based on Foata normal form. 4/96 useless extension candidates. Maximal degree in co-relation 63. Up to 48 conditions per place. [2025-03-04 10:18:36,861 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2025-03-04 10:18:36,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 215 flow [2025-03-04 10:18:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-03-04 10:18:36,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.706081081081081 [2025-03-04 10:18:36,863 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 159 flow. Second operand 4 states and 209 transitions. [2025-03-04 10:18:36,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 215 flow [2025-03-04 10:18:36,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:36,864 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 156 flow [2025-03-04 10:18:36,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2025-03-04 10:18:36,865 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-03-04 10:18:36,865 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 156 flow [2025-03-04 10:18:36,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-03-04 10:18:36,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:36,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:18:36,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:18:36,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:36,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:36,865 INFO L85 PathProgramCache]: Analyzing trace with hash -347661543, now seen corresponding path program 1 times [2025-03-04 10:18:36,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:36,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791916368] [2025-03-04 10:18:36,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:36,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:18:36,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:18:36,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:36,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:36,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:36,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791916368] [2025-03-04 10:18:36,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791916368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:36,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:36,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:36,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594407153] [2025-03-04 10:18:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:36,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:36,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:36,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:36,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:36,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2025-03-04 10:18:36,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-03-04 10:18:36,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:36,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2025-03-04 10:18:36,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:37,011 INFO L124 PetriNetUnfolderBase]: 26/124 cut-off events. [2025-03-04 10:18:37,011 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 10:18:37,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 124 events. 26/124 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 358 event pairs, 12 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 118. Up to 52 conditions per place. [2025-03-04 10:18:37,012 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 27 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-04 10:18:37,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 208 flow [2025-03-04 10:18:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-04 10:18:37,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2025-03-04 10:18:37,013 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 156 flow. Second operand 3 states and 155 transitions. [2025-03-04 10:18:37,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 208 flow [2025-03-04 10:18:37,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:37,016 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 146 flow [2025-03-04 10:18:37,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-03-04 10:18:37,020 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2025-03-04 10:18:37,020 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 146 flow [2025-03-04 10:18:37,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-03-04 10:18:37,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:37,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:18:37,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:18:37,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:37,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash -347661542, now seen corresponding path program 1 times [2025-03-04 10:18:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:37,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870419114] [2025-03-04 10:18:37,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:37,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:18:37,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:18:37,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:37,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:37,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:37,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870419114] [2025-03-04 10:18:37,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870419114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:37,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:37,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094121968] [2025-03-04 10:18:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:37,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:37,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:37,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:37,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:37,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2025-03-04 10:18:37,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-03-04 10:18:37,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:37,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2025-03-04 10:18:37,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:37,157 INFO L124 PetriNetUnfolderBase]: 24/114 cut-off events. [2025-03-04 10:18:37,157 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 10:18:37,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 114 events. 24/114 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 12 based on Foata normal form. 4/92 useless extension candidates. Maximal degree in co-relation 118. Up to 52 conditions per place. [2025-03-04 10:18:37,158 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 25 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-03-04 10:18:37,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 194 flow [2025-03-04 10:18:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2025-03-04 10:18:37,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-03-04 10:18:37,159 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 146 flow. Second operand 3 states and 159 transitions. [2025-03-04 10:18:37,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 194 flow [2025-03-04 10:18:37,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:37,160 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2025-03-04 10:18:37,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2025-03-04 10:18:37,161 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2025-03-04 10:18:37,161 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2025-03-04 10:18:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-03-04 10:18:37,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:37,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:37,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:18:37,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:37,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1849642564, now seen corresponding path program 1 times [2025-03-04 10:18:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210077597] [2025-03-04 10:18:37,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:37,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:37,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:37,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:37,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:37,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210077597] [2025-03-04 10:18:37,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210077597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:37,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:37,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:18:37,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533594005] [2025-03-04 10:18:37,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:37,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:18:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:37,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:18:37,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:18:37,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2025-03-04 10:18:37,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 138 flow. Second operand has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-03-04 10:18:37,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:37,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2025-03-04 10:18:37,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:37,795 INFO L124 PetriNetUnfolderBase]: 35/141 cut-off events. [2025-03-04 10:18:37,795 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 10:18:37,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 141 events. 35/141 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 406 event pairs, 19 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 132. Up to 73 conditions per place. [2025-03-04 10:18:37,808 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 32 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2025-03-04 10:18:37,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 260 flow [2025-03-04 10:18:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:18:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:18:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2025-03-04 10:18:37,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6527027027027027 [2025-03-04 10:18:37,810 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 138 flow. Second operand 10 states and 483 transitions. [2025-03-04 10:18:37,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 260 flow [2025-03-04 10:18:37,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:37,811 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 209 flow [2025-03-04 10:18:37,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=209, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2025-03-04 10:18:37,812 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2025-03-04 10:18:37,812 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 209 flow [2025-03-04 10:18:37,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-03-04 10:18:37,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:37,812 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:37,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:18:37,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:37,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1099048806, now seen corresponding path program 1 times [2025-03-04 10:18:37,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:37,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359872394] [2025-03-04 10:18:37,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:37,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:37,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:18:37,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:18:37,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:37,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:38,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:38,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359872394] [2025-03-04 10:18:38,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359872394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:38,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916556340] [2025-03-04 10:18:38,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:38,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:38,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:38,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:38,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:18:38,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:18:38,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:18:38,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:38,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:38,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:18:38,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:38,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:38,255 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-04 10:18:38,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-03-04 10:18:38,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 10:18:38,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:38,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 10:18:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:38,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:38,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-03-04 10:18:38,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:18:38,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2025-03-04 10:18:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:39,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916556340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:39,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:39,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 10:18:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150026821] [2025-03-04 10:18:39,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:39,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:18:39,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:39,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:18:39,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:18:40,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 74 [2025-03-04 10:18:40,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 209 flow. Second operand has 16 states, 16 states have (on average 40.75) internal successors, (652), 16 states have internal predecessors, (652), 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-03-04 10:18:40,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:40,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 74 [2025-03-04 10:18:40,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:40,230 INFO L124 PetriNetUnfolderBase]: 35/152 cut-off events. [2025-03-04 10:18:40,230 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-04 10:18:40,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 152 events. 35/152 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 469 event pairs, 5 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 160. Up to 31 conditions per place. [2025-03-04 10:18:40,231 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 37 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2025-03-04 10:18:40,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 322 flow [2025-03-04 10:18:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 360 transitions. [2025-03-04 10:18:40,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2025-03-04 10:18:40,232 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 209 flow. Second operand 8 states and 360 transitions. [2025-03-04 10:18:40,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 322 flow [2025-03-04 10:18:40,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:40,234 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 224 flow [2025-03-04 10:18:40,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2025-03-04 10:18:40,235 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-03-04 10:18:40,235 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 224 flow [2025-03-04 10:18:40,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 40.75) internal successors, (652), 16 states have internal predecessors, (652), 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-03-04 10:18:40,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:40,236 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:40,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:40,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:18:40,440 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:40,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1099048805, now seen corresponding path program 1 times [2025-03-04 10:18:40,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:40,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360133827] [2025-03-04 10:18:40,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:40,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:40,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:18:40,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:18:40,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:40,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:40,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:40,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360133827] [2025-03-04 10:18:40,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360133827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:40,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380921723] [2025-03-04 10:18:40,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:40,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:40,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:40,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:40,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:18:40,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:18:40,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:18:40,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:40,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:40,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 10:18:40,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:40,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:18:40,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:18:40,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:18:40,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:18:40,949 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:18:40,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:18:40,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:18:40,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:41,003 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 10:18:41,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-03-04 10:18:41,019 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 10:18:41,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 10:18:41,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 10:18:41,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:41,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:18:41,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 10:18:41,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 10:18:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:41,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:41,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2025-03-04 10:18:41,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-04 10:18:41,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-04 10:18:41,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:18:41,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2025-03-04 10:18:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:41,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380921723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:41,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:41,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-04 10:18:41,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488936137] [2025-03-04 10:18:41,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:41,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:18:41,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:41,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:18:41,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:18:42,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 10:18:42,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 224 flow. Second operand has 20 states, 20 states have (on average 37.1) internal successors, (742), 20 states have internal predecessors, (742), 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-03-04 10:18:42,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:42,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 10:18:42,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:43,048 INFO L124 PetriNetUnfolderBase]: 35/150 cut-off events. [2025-03-04 10:18:43,049 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 10:18:43,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 150 events. 35/150 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 446 event pairs, 5 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 169. Up to 31 conditions per place. [2025-03-04 10:18:43,050 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 37 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2025-03-04 10:18:43,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 337 flow [2025-03-04 10:18:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 328 transitions. [2025-03-04 10:18:43,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2025-03-04 10:18:43,051 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 224 flow. Second operand 8 states and 328 transitions. [2025-03-04 10:18:43,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 337 flow [2025-03-04 10:18:43,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 303 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-04 10:18:43,053 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 208 flow [2025-03-04 10:18:43,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-03-04 10:18:43,053 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2025-03-04 10:18:43,054 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 208 flow [2025-03-04 10:18:43,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 37.1) internal successors, (742), 20 states have internal predecessors, (742), 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-03-04 10:18:43,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:43,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:43,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:43,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 10:18:43,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:43,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash -609587531, now seen corresponding path program 1 times [2025-03-04 10:18:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:43,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681488809] [2025-03-04 10:18:43,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:43,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:18:43,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:18:43,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:43,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:43,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:43,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681488809] [2025-03-04 10:18:43,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681488809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:43,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:43,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:43,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822350015] [2025-03-04 10:18:43,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:43,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:43,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:43,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:43,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 74 [2025-03-04 10:18:43,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-03-04 10:18:43,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:43,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 74 [2025-03-04 10:18:43,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:43,417 INFO L124 PetriNetUnfolderBase]: 21/77 cut-off events. [2025-03-04 10:18:43,418 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 10:18:43,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 77 events. 21/77 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 14 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 69. Up to 51 conditions per place. [2025-03-04 10:18:43,418 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-03-04 10:18:43,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 196 flow [2025-03-04 10:18:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2025-03-04 10:18:43,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2025-03-04 10:18:43,422 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 208 flow. Second operand 5 states and 224 transitions. [2025-03-04 10:18:43,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 196 flow [2025-03-04 10:18:43,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 175 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:18:43,424 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 123 flow [2025-03-04 10:18:43,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-03-04 10:18:43,424 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -28 predicate places. [2025-03-04 10:18:43,424 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 123 flow [2025-03-04 10:18:43,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-03-04 10:18:43,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:43,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:43,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:18:43,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:43,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1638560624, now seen corresponding path program 1 times [2025-03-04 10:18:43,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:43,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564099255] [2025-03-04 10:18:43,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:43,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:18:43,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:43,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:43,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:43,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:18:43,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:18:43,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:43,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:43,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:43,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:18:43,466 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:18:43,467 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2025-03-04 10:18:43,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2025-03-04 10:18:43,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2025-03-04 10:18:43,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2025-03-04 10:18:43,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2025-03-04 10:18:43,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2025-03-04 10:18:43,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2025-03-04 10:18:43,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2025-03-04 10:18:43,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2025-03-04 10:18:43,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2025-03-04 10:18:43,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2025-03-04 10:18:43,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2025-03-04 10:18:43,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (37 of 61 remaining) [2025-03-04 10:18:43,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (36 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (35 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (34 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (33 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (32 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (31 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (30 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (29 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (7 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (6 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (5 of 61 remaining) [2025-03-04 10:18:43,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (4 of 61 remaining) [2025-03-04 10:18:43,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2025-03-04 10:18:43,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2025-03-04 10:18:43,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2025-03-04 10:18:43,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (0 of 61 remaining) [2025-03-04 10:18:43,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:18:43,472 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:43,509 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:18:43,509 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:18:43,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:18:43 BasicIcfg [2025-03-04 10:18:43,514 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:18:43,514 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:18:43,514 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:18:43,514 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:18:43,515 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:35" (3/4) ... [2025-03-04 10:18:43,516 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:18:43,517 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:18:43,518 INFO L158 Benchmark]: Toolchain (without parser) took 8615.03ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 111.2MB in the beginning and 155.2MB in the end (delta: -44.1MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2025-03-04 10:18:43,518 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:43,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.00ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 83.8MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:18:43,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.01ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:18:43,519 INFO L158 Benchmark]: Boogie Preprocessor took 40.99ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 79.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:43,519 INFO L158 Benchmark]: IcfgBuilder took 449.58ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 53.0MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:18:43,520 INFO L158 Benchmark]: TraceAbstraction took 7643.22ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 52.5MB in the beginning and 155.3MB in the end (delta: -102.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:43,520 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 218.1MB. Free memory was 155.3MB in the beginning and 155.2MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:43,521 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.00ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 83.8MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.01ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.99ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 79.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 449.58ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 53.0MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7643.22ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 52.5MB in the beginning and 155.3MB in the end (delta: -102.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 218.1MB. Free memory was 155.3MB in the beginning and 155.2MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1069. Possible FailurePath: [L1070] 0 pthread_t id1, id2; [L1071] 0 struct item *list = ((void *)0); [L1072] FCALL, FORK 0 pthread_create(&id1, ((void *)0), build, list) VAL [\old(argc)=9, \old(argv)={10:11}, argc=9, id1=-1, list={0:0}] [L1048] 1 struct item *list = (struct item *)plist; [L1048] 1 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1051] COND TRUE 1 __VERIFIER_nondet_int() [L1050] CALL 1 append(&list) [L1042] 1 struct item *elem = malloc(sizeof *elem); [L1043] EXPR 1 \read(**plist) VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1043] 1 elem->next = *plist [L1044] EXPR 1 elem->next VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) VAL [\old(plist)={2:0}, elem={-1:0}, plist={2:0}] [L1044] 1 elem->data = (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1045] 1 *plist = elem [L1050] RET 1 append(&list) [L1051] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1073] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) VAL [\old(argc)=9, \old(argv)={10:11}, argc=9, id1=-1, list={0:0}] [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, argc=9, id1=-1, id2=0, list={0:0}] [L1055] 2 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1056] COND FALSE 2 !(\read(*list)) VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1062] COND FALSE 2 !(\read(*list)) [L1075] FCALL, JOIN 2 pthread_join(id2, ((void *)0)) VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, \result={0:0}, argc=9, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] [L1076] 0 return 0; VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, \result=0, \result={0:0}, argc=9, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1074]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 130 locations, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1423 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1141 mSDsluCounter, 1401 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1354 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5144 IncrementalHoareTripleChecker+Invalid, 5209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 47 mSDtfsCounter, 5144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 10 QuantifiedInterpolants, 1815 SizeOfPredicates, 37 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 7/31 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 10:18:43,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-memsafety/list1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:18:45,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:18:45,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 10:18:45,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:18:45,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:18:45,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:18:45,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:18:45,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:18:45,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:18:45,398 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:18:45,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:18:45,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:18:45,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:18:45,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:18:45,399 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:18:45,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:18:45,400 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:18:45,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:18:45,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:18:45,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:18:45,400 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:18:45,400 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:18:45,400 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:18:45,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:18:45,401 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:18:45,401 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 10:18:45,401 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 10:18:45,401 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:18:45,401 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:18:45,401 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:18:45,401 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:18:45,402 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:18:45,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:18:45,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:18:45,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:18:45,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:45,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:18:45,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:18:45,402 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 10:18:45,402 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 10:18:45,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:18:45,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:18:45,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:18:45,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:18:45,403 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/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 -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2025-03-04 10:18:45,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:18:45,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:18:45,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:18:45,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:18:45,646 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:18:45,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2025-03-04 10:18:46,806 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b25317e8/941895d9af8141868fef315f5ec8eb83/FLAG401aeb9c5 [2025-03-04 10:18:47,040 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:18:47,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2025-03-04 10:18:47,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b25317e8/941895d9af8141868fef315f5ec8eb83/FLAG401aeb9c5 [2025-03-04 10:18:47,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b25317e8/941895d9af8141868fef315f5ec8eb83 [2025-03-04 10:18:47,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:18:47,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:18:47,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:47,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:18:47,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:18:47,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ba50f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47, skipping insertion in model container [2025-03-04 10:18:47,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:18:47,362 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:18:47,369 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:18:47,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:47,386 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:18:47,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:47,463 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:18:47,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47 WrapperNode [2025-03-04 10:18:47,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:47,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:47,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:18:47,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:18:47,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,502 INFO L138 Inliner]: procedures = 265, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-03-04 10:18:47,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:47,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:18:47,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:18:47,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:18:47,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,529 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [3, 8]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 3 writes are split as follows [1, 2]. [2025-03-04 10:18:47,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:18:47,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:18:47,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:18:47,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:18:47,554 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (1/1) ... [2025-03-04 10:18:47,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:47,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:18:47,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:18:47,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:18:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:18:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:18:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:18:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:18:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:18:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:18:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:18:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:18:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2025-03-04 10:18:47,615 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2025-03-04 10:18:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure build [2025-03-04 10:18:47,615 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2025-03-04 10:18:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:18:47,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:18:47,616 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:18:47,759 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:18:47,761 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:18:47,968 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: havoc ~#list~0#1.base, ~#list~0#1.offset; [2025-03-04 10:18:47,969 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: SUMMARY for call ULTIMATE.dealloc(~#list~0#1.base, ~#list~0#1.offset); srcloc: null [2025-03-04 10:18:48,094 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:18:48,095 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:18:48,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:18:48,189 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:18:48,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:48 BoogieIcfgContainer [2025-03-04 10:18:48,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:18:48,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:18:48,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:18:48,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:18:48,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:18:47" (1/3) ... [2025-03-04 10:18:48,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54568073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:48, skipping insertion in model container [2025-03-04 10:18:48,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:47" (2/3) ... [2025-03-04 10:18:48,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54568073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:48, skipping insertion in model container [2025-03-04 10:18:48,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:48" (3/3) ... [2025-03-04 10:18:48,199 INFO L128 eAbstractionObserver]: Analyzing ICFG list1.i [2025-03-04 10:18:48,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:18:48,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list1.i that has 3 procedures, 70 locations, 1 initial locations, 2 loop locations, and 30 error locations. [2025-03-04 10:18:48,210 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:18:48,303 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:18:48,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 162 flow [2025-03-04 10:18:48,355 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2025-03-04 10:18:48,359 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:48,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 5/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 216 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2025-03-04 10:18:48,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 162 flow [2025-03-04 10:18:48,365 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 154 flow [2025-03-04 10:18:48,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:48,382 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;@68894636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:48,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-04 10:18:48,387 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:48,388 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-04 10:18:48,388 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:18:48,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:48,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:18:48,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:48,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:48,394 INFO L85 PathProgramCache]: Analyzing trace with hash 265879768, now seen corresponding path program 1 times [2025-03-04 10:18:48,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:48,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277955058] [2025-03-04 10:18:48,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:48,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:48,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:48,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:48,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:18:48,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:18:48,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:18:48,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:48,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:48,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:18:48,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:48,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 10:18:48,599 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 10:18:48,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 10:18:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:48,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:48,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:48,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277955058] [2025-03-04 10:18:48,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277955058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:48,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:48,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:48,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077160907] [2025-03-04 10:18:48,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:48,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:48,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:48,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:48,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:48,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2025-03-04 10:18:48,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-03-04 10:18:48,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:48,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2025-03-04 10:18:48,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:48,809 INFO L124 PetriNetUnfolderBase]: 25/148 cut-off events. [2025-03-04 10:18:48,809 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:18:48,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 148 events. 25/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 512 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 120. Up to 31 conditions per place. [2025-03-04 10:18:48,811 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-03-04 10:18:48,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 231 flow [2025-03-04 10:18:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2025-03-04 10:18:48,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-03-04 10:18:48,820 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 154 flow. Second operand 4 states and 212 transitions. [2025-03-04 10:18:48,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 231 flow [2025-03-04 10:18:48,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:48,826 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 159 flow [2025-03-04 10:18:48,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-03-04 10:18:48,831 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2025-03-04 10:18:48,831 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 159 flow [2025-03-04 10:18:48,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-03-04 10:18:48,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:48,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:18:48,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:18:49,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:49,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:49,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 265879769, now seen corresponding path program 1 times [2025-03-04 10:18:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596832395] [2025-03-04 10:18:49,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:49,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:49,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:49,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:49,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:18:49,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:18:49,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:18:49,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:49,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:49,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:18:49,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:49,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 10:18:49,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:18:49,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:18:49,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:18:49,174 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 10:18:49,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 10:18:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:49,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:49,185 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596832395] [2025-03-04 10:18:49,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596832395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:49,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:49,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:49,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961821810] [2025-03-04 10:18:49,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:49,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:49,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:49,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:49,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:49,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2025-03-04 10:18:49,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-03-04 10:18:49,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:49,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2025-03-04 10:18:49,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:49,433 INFO L124 PetriNetUnfolderBase]: 27/156 cut-off events. [2025-03-04 10:18:49,433 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 10:18:49,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 156 events. 27/156 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 560 event pairs, 4 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 63. Up to 42 conditions per place. [2025-03-04 10:18:49,436 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 29 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-03-04 10:18:49,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 247 flow [2025-03-04 10:18:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2025-03-04 10:18:49,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7331081081081081 [2025-03-04 10:18:49,439 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 159 flow. Second operand 4 states and 217 transitions. [2025-03-04 10:18:49,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 247 flow [2025-03-04 10:18:49,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:49,441 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 175 flow [2025-03-04 10:18:49,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2025-03-04 10:18:49,443 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2025-03-04 10:18:49,443 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 175 flow [2025-03-04 10:18:49,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-03-04 10:18:49,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:49,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:18:49,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:49,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:49,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:49,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash -347661543, now seen corresponding path program 1 times [2025-03-04 10:18:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:49,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181317749] [2025-03-04 10:18:49,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:49,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:49,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:49,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:49,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:18:49,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:18:49,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:18:49,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:49,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:49,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:18:49,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:49,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 10:18:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:49,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:49,722 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:49,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181317749] [2025-03-04 10:18:49,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181317749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:49,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:49,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222235058] [2025-03-04 10:18:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:49,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:49,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:49,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:49,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:49,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2025-03-04 10:18:49,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-03-04 10:18:49,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:49,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2025-03-04 10:18:49,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:49,842 INFO L124 PetriNetUnfolderBase]: 28/134 cut-off events. [2025-03-04 10:18:49,842 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 10:18:49,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 134 events. 28/134 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 413 event pairs, 12 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 122. Up to 54 conditions per place. [2025-03-04 10:18:49,843 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 27 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-03-04 10:18:49,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 229 flow [2025-03-04 10:18:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-04 10:18:49,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2025-03-04 10:18:49,844 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 175 flow. Second operand 3 states and 155 transitions. [2025-03-04 10:18:49,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 229 flow [2025-03-04 10:18:49,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:49,846 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 164 flow [2025-03-04 10:18:49,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-04 10:18:49,846 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2025-03-04 10:18:49,846 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 164 flow [2025-03-04 10:18:49,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-03-04 10:18:49,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:49,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:18:49,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:50,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:50,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:50,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:50,052 INFO L85 PathProgramCache]: Analyzing trace with hash -347661542, now seen corresponding path program 1 times [2025-03-04 10:18:50,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:50,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [952376323] [2025-03-04 10:18:50,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:50,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:50,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:50,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:50,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:18:50,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:18:50,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:18:50,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:50,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:50,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:18:50,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:50,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:18:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:50,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:50,135 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:50,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952376323] [2025-03-04 10:18:50,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952376323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:50,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:50,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:50,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984967517] [2025-03-04 10:18:50,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:50,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:50,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:50,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:50,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:50,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2025-03-04 10:18:50,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-03-04 10:18:50,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:50,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2025-03-04 10:18:50,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:50,252 INFO L124 PetriNetUnfolderBase]: 26/122 cut-off events. [2025-03-04 10:18:50,252 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 10:18:50,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 122 events. 26/122 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 350 event pairs, 12 based on Foata normal form. 4/100 useless extension candidates. Maximal degree in co-relation 118. Up to 54 conditions per place. [2025-03-04 10:18:50,253 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2025-03-04 10:18:50,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 214 flow [2025-03-04 10:18:50,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2025-03-04 10:18:50,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-03-04 10:18:50,255 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 164 flow. Second operand 3 states and 159 transitions. [2025-03-04 10:18:50,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 214 flow [2025-03-04 10:18:50,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:50,256 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 156 flow [2025-03-04 10:18:50,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2025-03-04 10:18:50,257 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2025-03-04 10:18:50,257 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 156 flow [2025-03-04 10:18:50,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-03-04 10:18:50,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:50,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:50,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:18:50,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:50,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:50,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1849642564, now seen corresponding path program 1 times [2025-03-04 10:18:50,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:50,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014458874] [2025-03-04 10:18:50,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:50,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:50,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:50,460 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:50,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:18:50,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:50,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:50,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:50,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:50,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:18:50,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:50,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:18:50,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:18:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:50,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:50,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014458874] [2025-03-04 10:18:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014458874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:18:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087722905] [2025-03-04 10:18:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:18:50,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:50,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:18:50,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:18:50,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2025-03-04 10:18:50,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 156 flow. Second operand has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-03-04 10:18:50,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:50,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2025-03-04 10:18:50,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:51,205 INFO L124 PetriNetUnfolderBase]: 36/148 cut-off events. [2025-03-04 10:18:51,205 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 10:18:51,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 148 events. 36/148 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 451 event pairs, 20 based on Foata normal form. 2/124 useless extension candidates. Maximal degree in co-relation 118. Up to 76 conditions per place. [2025-03-04 10:18:51,206 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 33 selfloop transitions, 11 changer transitions 0/75 dead transitions. [2025-03-04 10:18:51,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 286 flow [2025-03-04 10:18:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:18:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:18:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2025-03-04 10:18:51,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6527027027027027 [2025-03-04 10:18:51,208 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 156 flow. Second operand 10 states and 483 transitions. [2025-03-04 10:18:51,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 286 flow [2025-03-04 10:18:51,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:51,209 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 231 flow [2025-03-04 10:18:51,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=231, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2025-03-04 10:18:51,210 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2025-03-04 10:18:51,210 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 231 flow [2025-03-04 10:18:51,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-03-04 10:18:51,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:51,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:51,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:51,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:51,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:51,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1849643684, now seen corresponding path program 1 times [2025-03-04 10:18:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:51,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206574272] [2025-03-04 10:18:51,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:51,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:51,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:51,414 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:51,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:18:51,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:51,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:51,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:51,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:51,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:18:51,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:51,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:18:51,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:18:51,533 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 10:18:51,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 10:18:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:51,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:51,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206574272] [2025-03-04 10:18:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206574272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:51,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314187397] [2025-03-04 10:18:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:51,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:51,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:51,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:51,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2025-03-04 10:18:51,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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-03-04 10:18:51,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:51,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2025-03-04 10:18:51,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:51,709 INFO L124 PetriNetUnfolderBase]: 33/141 cut-off events. [2025-03-04 10:18:51,709 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 10:18:51,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 141 events. 33/141 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 418 event pairs, 8 based on Foata normal form. 4/119 useless extension candidates. Maximal degree in co-relation 150. Up to 53 conditions per place. [2025-03-04 10:18:51,710 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 30 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2025-03-04 10:18:51,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 71 transitions, 309 flow [2025-03-04 10:18:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2025-03-04 10:18:51,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-03-04 10:18:51,715 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 231 flow. Second operand 5 states and 240 transitions. [2025-03-04 10:18:51,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 71 transitions, 309 flow [2025-03-04 10:18:51,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:51,718 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 240 flow [2025-03-04 10:18:51,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2025-03-04 10:18:51,720 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-03-04 10:18:51,720 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 240 flow [2025-03-04 10:18:51,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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-03-04 10:18:51,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:51,721 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:51,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:18:51,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:51,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:51,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1099048806, now seen corresponding path program 1 times [2025-03-04 10:18:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106542960] [2025-03-04 10:18:51,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:51,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:51,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:51,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:51,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:18:51,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:18:52,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:18:52,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:52,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:52,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:18:52,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:52,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:52,082 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2025-03-04 10:18:52,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 28 [2025-03-04 10:18:52,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 10:18:52,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:52,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 10:18:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:52,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:52,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-04 10:18:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:52,360 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:52,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106542960] [2025-03-04 10:18:52,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106542960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:52,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:18:52,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-04 10:18:52,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363291916] [2025-03-04 10:18:52,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:52,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:18:52,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:52,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:18:52,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:18:56,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:18:56,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 74 [2025-03-04 10:18:56,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 240 flow. Second operand has 13 states, 13 states have (on average 31.846153846153847) internal successors, (414), 13 states have internal predecessors, (414), 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-03-04 10:18:56,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:56,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 74 [2025-03-04 10:18:56,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:57,314 INFO L124 PetriNetUnfolderBase]: 44/168 cut-off events. [2025-03-04 10:18:57,314 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-03-04 10:18:57,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 168 events. 44/168 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 543 event pairs, 10 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 207. Up to 49 conditions per place. [2025-03-04 10:18:57,316 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 47 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2025-03-04 10:18:57,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 80 transitions, 381 flow [2025-03-04 10:18:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 298 transitions. [2025-03-04 10:18:57,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2025-03-04 10:18:57,318 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 240 flow. Second operand 8 states and 298 transitions. [2025-03-04 10:18:57,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 80 transitions, 381 flow [2025-03-04 10:18:57,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 80 transitions, 365 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:57,320 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 244 flow [2025-03-04 10:18:57,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2025-03-04 10:18:57,321 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 7 predicate places. [2025-03-04 10:18:57,321 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 244 flow [2025-03-04 10:18:57,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 31.846153846153847) internal successors, (414), 13 states have internal predecessors, (414), 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-03-04 10:18:57,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:57,321 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:57,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:18:57,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:57,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:18:57,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1099048805, now seen corresponding path program 1 times [2025-03-04 10:18:57,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:57,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66677402] [2025-03-04 10:18:57,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:57,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:57,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:57,529 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:57,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:18:57,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:18:57,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:18:57,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:57,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:57,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:18:57,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:57,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:18:57,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:57,753 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 10:18:57,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-03-04 10:18:57,779 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-03-04 10:18:57,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-03-04 10:18:57,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 10:18:57,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:18:57,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:57,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 10:18:57,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 10:18:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:57,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:58,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2025-03-04 10:18:58,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-04 10:18:58,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2025-03-04 10:18:59,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:18:59,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 303 treesize of output 401 [2025-03-04 10:18:59,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:18:59,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 254 treesize of output 518 [2025-03-04 10:19:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:19:16,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:19:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66677402] [2025-03-04 10:19:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66677402] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:19:16,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:19:16,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:19:16,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26039490] [2025-03-04 10:19:16,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:19:16,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:19:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:19:16,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:19:16,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:19:19,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 74 [2025-03-04 10:19:19,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 244 flow. Second operand has 16 states, 16 states have (on average 28.6875) internal successors, (459), 16 states have internal predecessors, (459), 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-03-04 10:19:19,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:19,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 74 [2025-03-04 10:19:19,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:20,808 INFO L124 PetriNetUnfolderBase]: 42/164 cut-off events. [2025-03-04 10:19:20,808 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-04 10:19:20,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 164 events. 42/164 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 523 event pairs, 10 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 209. Up to 48 conditions per place. [2025-03-04 10:19:20,810 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 43 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2025-03-04 10:19:20,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 78 transitions, 375 flow [2025-03-04 10:19:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:19:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:19:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 270 transitions. [2025-03-04 10:19:20,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4560810810810811 [2025-03-04 10:19:20,813 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 244 flow. Second operand 8 states and 270 transitions. [2025-03-04 10:19:20,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 78 transitions, 375 flow [2025-03-04 10:19:20,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 340 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-04 10:19:20,814 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 229 flow [2025-03-04 10:19:20,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2025-03-04 10:19:20,815 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-03-04 10:19:20,815 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 229 flow [2025-03-04 10:19:20,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 28.6875) internal successors, (459), 16 states have internal predecessors, (459), 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-03-04 10:19:20,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:20,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:20,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:19:21,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:21,016 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:19:21,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash -447582300, now seen corresponding path program 1 times [2025-03-04 10:19:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:19:21,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199065937] [2025-03-04 10:19:21,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:21,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:21,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:21,019 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:19:21,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:19:21,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:19:21,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:19:21,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:21,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:21,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:19:21,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:19:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:21,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:19:21,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:19:21,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199065937] [2025-03-04 10:19:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199065937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:21,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:21,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:19:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980005425] [2025-03-04 10:19:21,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:21,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:19:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:19:21,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:19:21,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:19:21,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 74 [2025-03-04 10:19:21,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-03-04 10:19:21,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:21,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 74 [2025-03-04 10:19:21,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:21,234 INFO L124 PetriNetUnfolderBase]: 22/80 cut-off events. [2025-03-04 10:19:21,234 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-04 10:19:21,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 80 events. 22/80 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 147 event pairs, 15 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 80. Up to 54 conditions per place. [2025-03-04 10:19:21,235 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 26 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2025-03-04 10:19:21,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 37 transitions, 219 flow [2025-03-04 10:19:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:19:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:19:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2025-03-04 10:19:21,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2025-03-04 10:19:21,236 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 229 flow. Second operand 5 states and 224 transitions. [2025-03-04 10:19:21,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 37 transitions, 219 flow [2025-03-04 10:19:21,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 195 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:19:21,237 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 141 flow [2025-03-04 10:19:21,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2025-03-04 10:19:21,237 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -26 predicate places. [2025-03-04 10:19:21,238 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 141 flow [2025-03-04 10:19:21,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-03-04 10:19:21,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:21,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:21,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:19:21,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:21,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:19:21,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:21,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1684819294, now seen corresponding path program 1 times [2025-03-04 10:19:21,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:19:21,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491003255] [2025-03-04 10:19:21,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:21,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:21,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:21,441 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:19:21,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:19:21,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:19:21,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:19:21,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:21,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:19:21,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:19:21,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:19:21,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:19:21,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:21,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:19:21,595 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 10:19:21,595 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:19:21,595 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2025-03-04 10:19:21,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (37 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (36 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (35 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (34 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (33 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (32 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (31 of 61 remaining) [2025-03-04 10:19:21,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (30 of 61 remaining) [2025-03-04 10:19:21,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (29 of 61 remaining) [2025-03-04 10:19:21,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2025-03-04 10:19:21,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2025-03-04 10:19:21,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2025-03-04 10:19:21,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2025-03-04 10:19:21,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2025-03-04 10:19:21,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2025-03-04 10:19:21,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2025-03-04 10:19:21,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (7 of 61 remaining) [2025-03-04 10:19:21,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (6 of 61 remaining) [2025-03-04 10:19:21,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (5 of 61 remaining) [2025-03-04 10:19:21,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (4 of 61 remaining) [2025-03-04 10:19:21,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2025-03-04 10:19:21,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2025-03-04 10:19:21,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2025-03-04 10:19:21,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (0 of 61 remaining) [2025-03-04 10:19:21,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:19:21,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:21,801 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:21,834 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:19:21,834 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:19:21,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:19:21 BasicIcfg [2025-03-04 10:19:21,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:19:21,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:19:21,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:19:21,838 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:19:21,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:48" (3/4) ... [2025-03-04 10:19:21,840 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:19:21,840 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:19:21,841 INFO L158 Benchmark]: Toolchain (without parser) took 34765.40ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 58.2MB in the beginning and 79.4MB in the end (delta: -21.2MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. [2025-03-04 10:19:21,841 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:19:21,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.48ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 30.3MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:19:21,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.85ms. Allocated memory is still 83.9MB. Free memory was 30.3MB in the beginning and 28.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:19:21,842 INFO L158 Benchmark]: Boogie Preprocessor took 49.51ms. Allocated memory is still 83.9MB. Free memory was 28.3MB in the beginning and 26.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:19:21,842 INFO L158 Benchmark]: IcfgBuilder took 636.30ms. Allocated memory is still 83.9MB. Free memory was 26.1MB in the beginning and 29.8MB in the end (delta: -3.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2025-03-04 10:19:21,843 INFO L158 Benchmark]: TraceAbstraction took 33646.71ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 29.3MB in the beginning and 79.4MB in the end (delta: -50.1MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2025-03-04 10:19:21,843 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 184.5MB. Free memory was 79.4MB in the beginning and 79.4MB in the end (delta: 11.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:19:21,844 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.48ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 30.3MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.85ms. Allocated memory is still 83.9MB. Free memory was 30.3MB in the beginning and 28.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.51ms. Allocated memory is still 83.9MB. Free memory was 28.3MB in the beginning and 26.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 636.30ms. Allocated memory is still 83.9MB. Free memory was 26.1MB in the beginning and 29.8MB in the end (delta: -3.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33646.71ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 29.3MB in the beginning and 79.4MB in the end (delta: -50.1MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 184.5MB. Free memory was 79.4MB in the beginning and 79.4MB in the end (delta: 11.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1069. Possible FailurePath: [L1070] 0 pthread_t id1, id2; [L1071] 0 struct item *list = ((void *)0); [L1072] FCALL, FORK 0 pthread_create(&id1, ((void *)0), build, list) VAL [\old(argc)=0, \old(argv)={0:0}, argc=0, id1=-1, list={0:0}] [L1048] 1 struct item *list = (struct item *)plist; [L1048] 1 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={4:0}, plist={0:0}] [L1051] COND TRUE 1 __VERIFIER_nondet_int() [L1050] CALL 1 append(&list) [L1042] 1 struct item *elem = malloc(sizeof *elem); [L1043] EXPR 1 \read(**plist) VAL [\old(plist)={0:0}, list={4:0}, plist={0:0}] [L1043] 1 elem->next = *plist [L1044] EXPR 1 elem->next VAL [\old(plist)={0:0}, list={4:0}, plist={0:0}] [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) VAL [\old(plist)={4:0}, elem={1:0}, plist={4:0}] [L1044] 1 elem->data = (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1045] 1 *plist = elem [L1050] RET 1 append(&list) [L1051] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1073] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) VAL [\old(argc)=0, \old(argv)={0:0}, argc=0, id1=-1, list={0:0}] [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [\old(argc)=0, \old(argv)={0:0}, \old(plist)={0:0}, argc=0, id1=-1, id2=0, list={0:0}] [L1055] 2 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1056] COND FALSE 2 !(\read(*list)) VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1062] COND FALSE 2 !(\read(*list)) [L1075] FCALL, JOIN 2 pthread_join(id2, ((void *)0)) VAL [\old(argc)=0, \old(argv)={0:0}, \old(plist)={0:0}, \result={0:0}, argc=0, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] [L1076] 0 return 0; VAL [\old(argc)=0, \old(argv)={0:0}, \old(plist)={0:0}, \result=0, \result={0:0}, argc=0, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1074]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 130 locations, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1360 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1022 mSDsluCounter, 1119 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1086 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3866 IncrementalHoareTripleChecker+Invalid, 3951 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 33 mSDtfsCounter, 3866 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 122 ConstructedInterpolants, 4 QuantifiedInterpolants, 1454 SizeOfPredicates, 69 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 7/23 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 10:19:21,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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: UNKNOWN: Overapproximated counterexample