./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:56:28,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:56:28,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:56:28,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:56:28,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:56:28,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:56:28,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:56:28,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:56:28,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:56:28,600 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:56:28,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:56:28,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:56:28,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:56:28,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:56:28,600 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:56:28,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:56:28,600 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:56:28,601 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:56:28,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:56:28,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:56:28,602 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2025-02-06 12:56:28,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:56:28,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:56:28,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:56:28,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:56:28,786 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:56:28,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-02-06 12:56:29,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/070d78841/2b68a36503c9453bba3f2d5f8026ad7f/FLAGbf45c7a5c [2025-02-06 12:56:30,318 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:56:30,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-02-06 12:56:30,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/070d78841/2b68a36503c9453bba3f2d5f8026ad7f/FLAGbf45c7a5c [2025-02-06 12:56:30,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/070d78841/2b68a36503c9453bba3f2d5f8026ad7f [2025-02-06 12:56:30,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:56:30,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:56:30,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:56:30,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:56:30,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:56:30,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:56:30" (1/1) ... [2025-02-06 12:56:30,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57aca075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:30, skipping insertion in model container [2025-02-06 12:56:30,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:56:30" (1/1) ... [2025-02-06 12:56:30,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:56:30,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:56:30,930 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:56:30,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:56:31,006 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:56:31,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31 WrapperNode [2025-02-06 12:56:31,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:56:31,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:56:31,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:56:31,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:56:31,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,043 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 126 [2025-02-06 12:56:31,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:56:31,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:56:31,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:56:31,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:56:31,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,072 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-02-06 12:56:31,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:56:31,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:56:31,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:56:31,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:56:31,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (1/1) ... [2025-02-06 12:56:31,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:56:31,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:56:31,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:56:31,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:56:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:56:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:56:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:56:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:56:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:56:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:56:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:56:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:56:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:56:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:56:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:56:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 12:56:31,134 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 12:56:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:56:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:56:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:56:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:56:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:56:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:56:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:56:31,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:56:31,135 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:56:31,263 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:56:31,264 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:56:31,458 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 12:56:31,459 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 12:56:31,493 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:56:31,493 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:56:31,640 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:56:31,641 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:56:31,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:56:31 BoogieIcfgContainer [2025-02-06 12:56:31,642 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:56:31,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:56:31,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:56:31,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:56:31,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:56:30" (1/3) ... [2025-02-06 12:56:31,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39475ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:56:31, skipping insertion in model container [2025-02-06 12:56:31,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:56:31" (2/3) ... [2025-02-06 12:56:31,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39475ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:56:31, skipping insertion in model container [2025-02-06 12:56:31,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:56:31" (3/3) ... [2025-02-06 12:56:31,650 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2025-02-06 12:56:31,661 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:56:31,663 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_02-simple_racefree.i that has 2 procedures, 52 locations, 1 initial locations, 6 loop locations, and 6 error locations. [2025-02-06 12:56:31,663 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:56:31,703 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 12:56:31,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 63 transitions, 133 flow [2025-02-06 12:56:31,769 INFO L124 PetriNetUnfolderBase]: 15/95 cut-off events. [2025-02-06 12:56:31,771 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:56:31,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 95 events. 15/95 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 360 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2025-02-06 12:56:31,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 63 transitions, 133 flow [2025-02-06 12:56:31,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 63 transitions, 133 flow [2025-02-06 12:56:31,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:56:31,788 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;@191c1c09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:56:31,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:56:31,791 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:56:31,791 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:56:31,791 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:56:31,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:31,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:56:31,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:31,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:31,795 INFO L85 PathProgramCache]: Analyzing trace with hash 399526, now seen corresponding path program 1 times [2025-02-06 12:56:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:31,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750474570] [2025-02-06 12:56:31,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:31,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:31,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:56:31,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:56:31,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:31,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:32,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750474570] [2025-02-06 12:56:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750474570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:32,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:32,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:56:32,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229445304] [2025-02-06 12:56:32,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:32,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:56:32,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:32,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:56:32,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:56:32,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2025-02-06 12:56:32,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 63 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:32,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:32,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2025-02-06 12:56:32,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:32,266 INFO L124 PetriNetUnfolderBase]: 136/454 cut-off events. [2025-02-06 12:56:32,266 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:56:32,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 454 events. 136/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2310 event pairs, 117 based on Foata normal form. 133/566 useless extension candidates. Maximal degree in co-relation 716. Up to 272 conditions per place. [2025-02-06 12:56:32,273 INFO L140 encePairwiseOnDemand]: 49/63 looper letters, 34 selfloop transitions, 2 changer transitions 1/59 dead transitions. [2025-02-06 12:56:32,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 199 flow [2025-02-06 12:56:32,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:56:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:56:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-02-06 12:56:32,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6402116402116402 [2025-02-06 12:56:32,288 INFO L175 Difference]: Start difference. First operand has 55 places, 63 transitions, 133 flow. Second operand 3 states and 121 transitions. [2025-02-06 12:56:32,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 199 flow [2025-02-06 12:56:32,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 199 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:56:32,294 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 109 flow [2025-02-06 12:56:32,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2025-02-06 12:56:32,299 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2025-02-06 12:56:32,300 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 109 flow [2025-02-06 12:56:32,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:32,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:32,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:56:32,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:56:32,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:32,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash 399527, now seen corresponding path program 1 times [2025-02-06 12:56:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:32,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118185239] [2025-02-06 12:56:32,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:32,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:56:32,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:56:32,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:32,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:32,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:32,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118185239] [2025-02-06 12:56:32,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118185239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:32,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:32,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:56:32,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420955604] [2025-02-06 12:56:32,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:32,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:56:32,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:32,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:56:32,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:56:32,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 63 [2025-02-06 12:56:32,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:32,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:32,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 63 [2025-02-06 12:56:32,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:32,562 INFO L124 PetriNetUnfolderBase]: 117/405 cut-off events. [2025-02-06 12:56:32,562 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 12:56:32,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 405 events. 117/405 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1990 event pairs, 96 based on Foata normal form. 1/379 useless extension candidates. Maximal degree in co-relation 657. Up to 251 conditions per place. [2025-02-06 12:56:32,565 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 34 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-02-06 12:56:32,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 201 flow [2025-02-06 12:56:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:56:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:56:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-02-06 12:56:32,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5978835978835979 [2025-02-06 12:56:32,566 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 109 flow. Second operand 3 states and 113 transitions. [2025-02-06 12:56:32,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 201 flow [2025-02-06 12:56:32,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:56:32,568 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 115 flow [2025-02-06 12:56:32,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2025-02-06 12:56:32,569 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2025-02-06 12:56:32,569 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 115 flow [2025-02-06 12:56:32,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:32,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:32,570 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 12:56:32,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:56:32,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:32,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:32,570 INFO L85 PathProgramCache]: Analyzing trace with hash -384688490, now seen corresponding path program 1 times [2025-02-06 12:56:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:32,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929058206] [2025-02-06 12:56:32,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:32,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:56:32,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:56:32,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:32,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:32,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:32,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929058206] [2025-02-06 12:56:32,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929058206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:32,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:32,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:56:32,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989340870] [2025-02-06 12:56:32,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:32,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:56:32,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:32,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:56:32,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:56:32,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2025-02-06 12:56:32,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:32,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:32,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2025-02-06 12:56:32,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:32,939 INFO L124 PetriNetUnfolderBase]: 27/107 cut-off events. [2025-02-06 12:56:32,939 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 12:56:32,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 107 events. 27/107 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 246 event pairs, 18 based on Foata normal form. 20/126 useless extension candidates. Maximal degree in co-relation 186. Up to 57 conditions per place. [2025-02-06 12:56:32,941 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 23 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2025-02-06 12:56:32,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 132 flow [2025-02-06 12:56:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:56:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:56:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-02-06 12:56:32,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-02-06 12:56:32,943 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 115 flow. Second operand 4 states and 123 transitions. [2025-02-06 12:56:32,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 132 flow [2025-02-06 12:56:32,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:56:32,944 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 58 flow [2025-02-06 12:56:32,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2025-02-06 12:56:32,944 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -24 predicate places. [2025-02-06 12:56:32,944 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 58 flow [2025-02-06 12:56:32,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:32,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:32,945 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 12:56:32,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:56:32,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:32,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash 959559052, now seen corresponding path program 1 times [2025-02-06 12:56:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:32,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515485936] [2025-02-06 12:56:32,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:32,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:56:32,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:56:32,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:32,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:56:32,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:56:32,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:56:32,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:56:32,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:32,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:56:33,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:56:33,018 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:56:33,019 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-06 12:56:33,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-02-06 12:56:33,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-02-06 12:56:33,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-02-06 12:56:33,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-02-06 12:56:33,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-06 12:56:33,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:56:33,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:56:33,021 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 12:56:33,024 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:56:33,024 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:56:33,045 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:56:33,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 90 transitions, 196 flow [2025-02-06 12:56:33,063 INFO L124 PetriNetUnfolderBase]: 27/166 cut-off events. [2025-02-06 12:56:33,063 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 12:56:33,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 166 events. 27/166 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 719 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 99. Up to 6 conditions per place. [2025-02-06 12:56:33,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 90 transitions, 196 flow [2025-02-06 12:56:33,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 90 transitions, 196 flow [2025-02-06 12:56:33,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:56:33,068 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;@191c1c09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:56:33,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:56:33,070 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:56:33,070 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:56:33,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:56:33,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:33,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:56:33,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:33,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash 488896, now seen corresponding path program 1 times [2025-02-06 12:56:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:33,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476334393] [2025-02-06 12:56:33,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:33,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:33,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:56:33,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:56:33,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:33,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:33,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:33,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476334393] [2025-02-06 12:56:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476334393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:33,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:56:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538567407] [2025-02-06 12:56:33,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:33,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:56:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:33,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:56:33,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:56:33,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 90 [2025-02-06 12:56:33,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 90 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:33,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:33,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 90 [2025-02-06 12:56:33,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:33,660 INFO L124 PetriNetUnfolderBase]: 2991/6215 cut-off events. [2025-02-06 12:56:33,660 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-02-06 12:56:33,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11100 conditions, 6215 events. 2991/6215 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 48474 event pairs, 2583 based on Foata normal form. 2391/8311 useless extension candidates. Maximal degree in co-relation 8128. Up to 4189 conditions per place. [2025-02-06 12:56:33,688 INFO L140 encePairwiseOnDemand]: 70/90 looper letters, 54 selfloop transitions, 2 changer transitions 1/89 dead transitions. [2025-02-06 12:56:33,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 308 flow [2025-02-06 12:56:33,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:56:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:56:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2025-02-06 12:56:33,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2025-02-06 12:56:33,690 INFO L175 Difference]: Start difference. First operand has 77 places, 90 transitions, 196 flow. Second operand 3 states and 183 transitions. [2025-02-06 12:56:33,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 308 flow [2025-02-06 12:56:33,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 89 transitions, 308 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:56:33,692 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 160 flow [2025-02-06 12:56:33,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2025-02-06 12:56:33,693 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -1 predicate places. [2025-02-06 12:56:33,693 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 160 flow [2025-02-06 12:56:33,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:33,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:33,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:56:33,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:56:33,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:33,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash 488897, now seen corresponding path program 1 times [2025-02-06 12:56:33,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:33,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602330866] [2025-02-06 12:56:33,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:33,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:33,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:56:33,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:56:33,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:33,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:33,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:33,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602330866] [2025-02-06 12:56:33,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602330866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:33,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:33,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:56:33,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052546624] [2025-02-06 12:56:33,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:33,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:56:33,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:33,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:56:33,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:56:33,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 90 [2025-02-06 12:56:33,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:33,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:33,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 90 [2025-02-06 12:56:33,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:34,281 INFO L124 PetriNetUnfolderBase]: 2594/5574 cut-off events. [2025-02-06 12:56:34,281 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-02-06 12:56:34,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9934 conditions, 5574 events. 2594/5574 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 43541 event pairs, 2421 based on Foata normal form. 1/5239 useless extension candidates. Maximal degree in co-relation 9066. Up to 4168 conditions per place. [2025-02-06 12:56:34,305 INFO L140 encePairwiseOnDemand]: 86/90 looper letters, 46 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2025-02-06 12:56:34,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 278 flow [2025-02-06 12:56:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:56:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:56:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-02-06 12:56:34,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-02-06 12:56:34,307 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 160 flow. Second operand 3 states and 155 transitions. [2025-02-06 12:56:34,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 278 flow [2025-02-06 12:56:34,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 81 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:56:34,311 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 170 flow [2025-02-06 12:56:34,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2025-02-06 12:56:34,312 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -1 predicate places. [2025-02-06 12:56:34,312 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 170 flow [2025-02-06 12:56:34,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:34,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:34,312 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 12:56:34,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:56:34,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:34,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 549519991, now seen corresponding path program 1 times [2025-02-06 12:56:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:34,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638321178] [2025-02-06 12:56:34,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:34,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:56:34,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:56:34,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:34,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:34,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:34,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638321178] [2025-02-06 12:56:34,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638321178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:34,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:56:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923289759] [2025-02-06 12:56:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:56:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:34,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:56:34,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:56:34,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 90 [2025-02-06 12:56:34,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:34,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:34,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 90 [2025-02-06 12:56:34,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:34,810 INFO L124 PetriNetUnfolderBase]: 2585/5724 cut-off events. [2025-02-06 12:56:34,810 INFO L125 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2025-02-06 12:56:34,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10275 conditions, 5724 events. 2585/5724 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 47981 event pairs, 88 based on Foata normal form. 10/5473 useless extension candidates. Maximal degree in co-relation 9161. Up to 3921 conditions per place. [2025-02-06 12:56:34,831 INFO L140 encePairwiseOnDemand]: 86/90 looper letters, 64 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2025-02-06 12:56:34,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 101 transitions, 368 flow [2025-02-06 12:56:34,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:56:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:56:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-02-06 12:56:34,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805555555555556 [2025-02-06 12:56:34,833 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 170 flow. Second operand 4 states and 209 transitions. [2025-02-06 12:56:34,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 101 transitions, 368 flow [2025-02-06 12:56:34,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 101 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:56:34,835 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 187 flow [2025-02-06 12:56:34,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2025-02-06 12:56:34,836 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-02-06 12:56:34,836 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 187 flow [2025-02-06 12:56:34,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:34,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:34,836 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-06 12:56:34,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:56:34,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash -69617524, now seen corresponding path program 1 times [2025-02-06 12:56:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:34,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781846291] [2025-02-06 12:56:34,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:34,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:34,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:56:34,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:56:34,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:34,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:34,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781846291] [2025-02-06 12:56:34,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781846291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:34,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:56:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212862272] [2025-02-06 12:56:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:34,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:56:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:34,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:56:34,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:56:34,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 90 [2025-02-06 12:56:34,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:34,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:34,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 90 [2025-02-06 12:56:34,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:35,391 INFO L124 PetriNetUnfolderBase]: 2405/5412 cut-off events. [2025-02-06 12:56:35,392 INFO L125 PetriNetUnfolderBase]: For 988/988 co-relation queries the response was YES. [2025-02-06 12:56:35,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9905 conditions, 5412 events. 2405/5412 cut-off events. For 988/988 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 44620 event pairs, 168 based on Foata normal form. 100/5340 useless extension candidates. Maximal degree in co-relation 7234. Up to 3081 conditions per place. [2025-02-06 12:56:35,412 INFO L140 encePairwiseOnDemand]: 86/90 looper letters, 80 selfloop transitions, 5 changer transitions 0/118 dead transitions. [2025-02-06 12:56:35,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 118 transitions, 445 flow [2025-02-06 12:56:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:56:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:56:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2025-02-06 12:56:35,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-02-06 12:56:35,414 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 187 flow. Second operand 5 states and 261 transitions. [2025-02-06 12:56:35,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 118 transitions, 445 flow [2025-02-06 12:56:35,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 118 transitions, 436 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 12:56:35,417 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 182 flow [2025-02-06 12:56:35,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2025-02-06 12:56:35,417 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-02-06 12:56:35,417 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 182 flow [2025-02-06 12:56:35,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:35,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:35,418 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-02-06 12:56:35,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:56:35,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:35,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:35,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2136824521, now seen corresponding path program 1 times [2025-02-06 12:56:35,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:35,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979986259] [2025-02-06 12:56:35,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:35,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:35,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:56:35,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:56:35,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:35,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:56:35,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:56:35,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:56:35,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:56:35,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:35,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:56:35,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:56:35,460 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:56:35,460 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-06 12:56:35,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-02-06 12:56:35,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-02-06 12:56:35,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-02-06 12:56:35,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-02-06 12:56:35,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-06 12:56:35,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:56:35,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:56:35,461 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 12:56:35,461 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:56:35,461 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:56:35,480 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 12:56:35,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 117 transitions, 261 flow [2025-02-06 12:56:35,499 INFO L124 PetriNetUnfolderBase]: 42/258 cut-off events. [2025-02-06 12:56:35,499 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 12:56:35,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 258 events. 42/258 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1204 event pairs, 1 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 177. Up to 12 conditions per place. [2025-02-06 12:56:35,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 117 transitions, 261 flow [2025-02-06 12:56:35,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 117 transitions, 261 flow [2025-02-06 12:56:35,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:56:35,503 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;@191c1c09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:56:35,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:56:35,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:56:35,505 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:56:35,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:56:35,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:35,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:56:35,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:35,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash 605077, now seen corresponding path program 1 times [2025-02-06 12:56:35,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:35,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823599979] [2025-02-06 12:56:35,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:35,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:56:35,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:56:35,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:35,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823599979] [2025-02-06 12:56:35,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823599979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:35,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:35,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:56:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827562363] [2025-02-06 12:56:35,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:35,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:56:35,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:35,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:56:35,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:56:35,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 117 [2025-02-06 12:56:35,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 117 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:35,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:35,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 117 [2025-02-06 12:56:35,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:39,985 INFO L124 PetriNetUnfolderBase]: 47447/80074 cut-off events. [2025-02-06 12:56:39,986 INFO L125 PetriNetUnfolderBase]: For 1182/1182 co-relation queries the response was YES. [2025-02-06 12:56:40,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147307 conditions, 80074 events. 47447/80074 cut-off events. For 1182/1182 co-relation queries the response was YES. Maximal size of possible extension queue 2137. Compared 738629 event pairs, 40780 based on Foata normal form. 35099/111678 useless extension candidates. Maximal degree in co-relation 75152. Up to 57237 conditions per place. [2025-02-06 12:56:40,355 INFO L140 encePairwiseOnDemand]: 91/117 looper letters, 74 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2025-02-06 12:56:40,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 119 transitions, 419 flow [2025-02-06 12:56:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:56:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:56:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-02-06 12:56:40,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.698005698005698 [2025-02-06 12:56:40,358 INFO L175 Difference]: Start difference. First operand has 99 places, 117 transitions, 261 flow. Second operand 3 states and 245 transitions. [2025-02-06 12:56:40,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 119 transitions, 419 flow [2025-02-06 12:56:40,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 119 transitions, 419 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:56:40,362 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 213 flow [2025-02-06 12:56:40,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2025-02-06 12:56:40,363 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -1 predicate places. [2025-02-06 12:56:40,364 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 213 flow [2025-02-06 12:56:40,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:40,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:40,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:56:40,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:56:40,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:40,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash 605078, now seen corresponding path program 1 times [2025-02-06 12:56:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:40,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062354872] [2025-02-06 12:56:40,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:40,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:40,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:56:40,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:56:40,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:40,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:40,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:40,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062354872] [2025-02-06 12:56:40,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062354872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:40,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:56:40,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095607736] [2025-02-06 12:56:40,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:40,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:56:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:40,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:56:40,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:56:40,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 117 [2025-02-06 12:56:40,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:40,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:40,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 117 [2025-02-06 12:56:40,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:44,451 INFO L124 PetriNetUnfolderBase]: 40912/71218 cut-off events. [2025-02-06 12:56:44,451 INFO L125 PetriNetUnfolderBase]: For 2450/2450 co-relation queries the response was YES. [2025-02-06 12:56:44,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130578 conditions, 71218 events. 40912/71218 cut-off events. For 2450/2450 co-relation queries the response was YES. Maximal size of possible extension queue 1999. Compared 670478 event pairs, 26434 based on Foata normal form. 1/68044 useless extension candidates. Maximal degree in co-relation 118851. Up to 57216 conditions per place. [2025-02-06 12:56:44,798 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 57 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2025-02-06 12:56:44,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 102 transitions, 353 flow [2025-02-06 12:56:44,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:56:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:56:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2025-02-06 12:56:44,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5584045584045584 [2025-02-06 12:56:44,799 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 213 flow. Second operand 3 states and 196 transitions. [2025-02-06 12:56:44,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 102 transitions, 353 flow [2025-02-06 12:56:44,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 102 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:56:44,899 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 223 flow [2025-02-06 12:56:44,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2025-02-06 12:56:44,900 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -1 predicate places. [2025-02-06 12:56:44,900 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 223 flow [2025-02-06 12:56:44,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:44,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:44,900 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 12:56:44,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:56:44,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:44,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 475277395, now seen corresponding path program 1 times [2025-02-06 12:56:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:44,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794871910] [2025-02-06 12:56:44,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:44,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:56:44,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:56:44,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:44,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:44,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794871910] [2025-02-06 12:56:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794871910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:56:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422604734] [2025-02-06 12:56:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:56:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:44,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:56:44,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:56:45,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 117 [2025-02-06 12:56:45,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:45,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:45,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 117 [2025-02-06 12:56:45,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:49,187 INFO L124 PetriNetUnfolderBase]: 40903/72443 cut-off events. [2025-02-06 12:56:49,188 INFO L125 PetriNetUnfolderBase]: For 4819/4819 co-relation queries the response was YES. [2025-02-06 12:56:49,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133784 conditions, 72443 events. 40903/72443 cut-off events. For 4819/4819 co-relation queries the response was YES. Maximal size of possible extension queue 2062. Compared 702330 event pairs, 12277 based on Foata normal form. 10/70876 useless extension candidates. Maximal degree in co-relation 13427. Up to 56969 conditions per place. [2025-02-06 12:56:49,557 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 76 selfloop transitions, 4 changer transitions 0/123 dead transitions. [2025-02-06 12:56:49,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 123 transitions, 449 flow [2025-02-06 12:56:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:56:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:56:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2025-02-06 12:56:49,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2025-02-06 12:56:49,558 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 223 flow. Second operand 4 states and 261 transitions. [2025-02-06 12:56:49,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 123 transitions, 449 flow [2025-02-06 12:56:49,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 123 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:56:49,561 INFO L231 Difference]: Finished difference. Result has 101 places, 94 transitions, 246 flow [2025-02-06 12:56:49,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=101, PETRI_TRANSITIONS=94} [2025-02-06 12:56:49,562 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 2 predicate places. [2025-02-06 12:56:49,562 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 94 transitions, 246 flow [2025-02-06 12:56:49,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:49,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:49,562 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-06 12:56:49,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:56:49,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash 196141807, now seen corresponding path program 1 times [2025-02-06 12:56:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014031326] [2025-02-06 12:56:49,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:49,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:56:49,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:56:49,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:49,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:49,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:49,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014031326] [2025-02-06 12:56:49,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014031326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:49,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:49,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:56:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998713027] [2025-02-06 12:56:49,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:49,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:56:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:49,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:56:49,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:56:49,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-02-06 12:56:49,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 94 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:49,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:49,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-02-06 12:56:49,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:54,035 INFO L124 PetriNetUnfolderBase]: 40912/70708 cut-off events. [2025-02-06 12:56:54,035 INFO L125 PetriNetUnfolderBase]: For 9936/9936 co-relation queries the response was YES. [2025-02-06 12:56:54,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133291 conditions, 70708 events. 40912/70708 cut-off events. For 9936/9936 co-relation queries the response was YES. Maximal size of possible extension queue 1975. Compared 660601 event pairs, 17518 based on Foata normal form. 1100/70153 useless extension candidates. Maximal degree in co-relation 10223. Up to 42229 conditions per place. [2025-02-06 12:56:54,350 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 129 selfloop transitions, 7 changer transitions 0/178 dead transitions. [2025-02-06 12:56:54,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 178 transitions, 682 flow [2025-02-06 12:56:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:56:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:56:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 401 transitions. [2025-02-06 12:56:54,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5712250712250713 [2025-02-06 12:56:54,353 INFO L175 Difference]: Start difference. First operand has 101 places, 94 transitions, 246 flow. Second operand 6 states and 401 transitions. [2025-02-06 12:56:54,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 178 transitions, 682 flow [2025-02-06 12:56:54,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 178 transitions, 673 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 12:56:54,356 INFO L231 Difference]: Finished difference. Result has 104 places, 94 transitions, 253 flow [2025-02-06 12:56:54,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=104, PETRI_TRANSITIONS=94} [2025-02-06 12:56:54,357 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 5 predicate places. [2025-02-06 12:56:54,357 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 94 transitions, 253 flow [2025-02-06 12:56:54,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:54,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:54,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:56:54,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:56:54,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:54,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:54,358 INFO L85 PathProgramCache]: Analyzing trace with hash -73735560, now seen corresponding path program 1 times [2025-02-06 12:56:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684345712] [2025-02-06 12:56:54,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:54,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 12:56:54,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 12:56:54,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:54,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:54,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684345712] [2025-02-06 12:56:54,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684345712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:54,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:54,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:56:54,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534654021] [2025-02-06 12:56:54,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:54,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:56:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:54,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:56:54,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:56:54,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 117 [2025-02-06 12:56:54,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:54,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:54,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 117 [2025-02-06 12:56:54,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:56:58,623 INFO L124 PetriNetUnfolderBase]: 37941/68060 cut-off events. [2025-02-06 12:56:58,623 INFO L125 PetriNetUnfolderBase]: For 17600/17600 co-relation queries the response was YES. [2025-02-06 12:56:58,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131773 conditions, 68060 events. 37941/68060 cut-off events. For 17600/17600 co-relation queries the response was YES. Maximal size of possible extension queue 1970. Compared 663638 event pairs, 11466 based on Foata normal form. 10/65969 useless extension candidates. Maximal degree in co-relation 10257. Up to 52827 conditions per place. [2025-02-06 12:56:58,909 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 75 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2025-02-06 12:56:58,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 121 transitions, 461 flow [2025-02-06 12:56:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:56:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:56:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2025-02-06 12:56:58,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.561965811965812 [2025-02-06 12:56:58,911 INFO L175 Difference]: Start difference. First operand has 104 places, 94 transitions, 253 flow. Second operand 4 states and 263 transitions. [2025-02-06 12:56:58,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 121 transitions, 461 flow [2025-02-06 12:56:58,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 121 transitions, 443 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-06 12:56:58,941 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 235 flow [2025-02-06 12:56:58,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2025-02-06 12:56:58,941 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 3 predicate places. [2025-02-06 12:56:58,941 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 235 flow [2025-02-06 12:56:58,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:58,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:58,942 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2025-02-06 12:56:58,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:56:58,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:58,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:58,943 INFO L85 PathProgramCache]: Analyzing trace with hash 607460281, now seen corresponding path program 1 times [2025-02-06 12:56:58,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:58,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485048589] [2025-02-06 12:56:58,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:58,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:56:58,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:56:58,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:58,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:56:58,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:56:58,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:56:58,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:56:58,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:58,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:56:58,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:56:58,982 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:56:58,982 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-06 12:56:58,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-02-06 12:56:58,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-02-06 12:56:58,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-02-06 12:56:58,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-02-06 12:56:58,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-06 12:56:58,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:56:58,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:56:58,982 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 12:56:58,983 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:56:58,983 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 12:56:59,007 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 12:56:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 144 transitions, 328 flow [2025-02-06 12:56:59,029 INFO L124 PetriNetUnfolderBase]: 65/394 cut-off events. [2025-02-06 12:56:59,029 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 12:56:59,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 394 events. 65/394 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1977 event pairs, 6 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 282. Up to 32 conditions per place. [2025-02-06 12:56:59,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 144 transitions, 328 flow [2025-02-06 12:56:59,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 144 transitions, 328 flow [2025-02-06 12:56:59,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:56:59,036 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;@191c1c09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:56:59,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:56:59,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:56:59,038 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:56:59,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:56:59,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:56:59,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:56:59,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 12:56:59,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:56:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash 748069, now seen corresponding path program 1 times [2025-02-06 12:56:59,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:56:59,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576469431] [2025-02-06 12:56:59,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:56:59,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:56:59,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:56:59,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:56:59,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:56:59,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:56:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:56:59,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:56:59,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576469431] [2025-02-06 12:56:59,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576469431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:56:59,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:56:59,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:56:59,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111433008] [2025-02-06 12:56:59,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:56:59,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:56:59,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:56:59,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:56:59,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:56:59,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 144 [2025-02-06 12:56:59,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 144 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:56:59,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:56:59,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 144 [2025-02-06 12:56:59,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand