./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.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_19-callback_racing.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 a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:57:09,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:57:09,468 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:57:09,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:57:09,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:57:09,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:57:09,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:57:09,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:57:09,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:57:09,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:57:09,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:57:09,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:57:09,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:57:09,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:57:09,489 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:57:09,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:57:09,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:57:09,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:57:09,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:57:09,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:57:09,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:57:09,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:57:09,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:57:09,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:57:09,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:57:09,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:57:09,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:57:09,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:57:09,491 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 -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2025-02-06 12:57:09,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:57:09,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:57:09,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:57:09,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:57:09,793 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:57:09,794 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_19-callback_racing.i [2025-02-06 12:57:10,991 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dca5dc1b9/359d4bbdf88b42f29705649fd78bc815/FLAG73a1015f6 [2025-02-06 12:57:11,336 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:57:11,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-02-06 12:57:11,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dca5dc1b9/359d4bbdf88b42f29705649fd78bc815/FLAG73a1015f6 [2025-02-06 12:57:11,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dca5dc1b9/359d4bbdf88b42f29705649fd78bc815 [2025-02-06 12:57:11,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:57:11,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:57:11,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:57:11,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:57:11,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:57:11,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:57:11" (1/1) ... [2025-02-06 12:57:11,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397040de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:11, skipping insertion in model container [2025-02-06 12:57:11,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:57:11" (1/1) ... [2025-02-06 12:57:11,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:57:11,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:57:11,973 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:57:12,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:57:12,053 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:57:12,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12 WrapperNode [2025-02-06 12:57:12,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:57:12,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:57:12,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:57:12,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:57:12,060 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:57:12" (1/1) ... [2025-02-06 12:57:12,071 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:57:12" (1/1) ... [2025-02-06 12:57:12,091 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 136 [2025-02-06 12:57:12,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:57:12,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:57:12,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:57:12,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:57:12,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (1/1) ... [2025-02-06 12:57:12,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (1/1) ... [2025-02-06 12:57:12,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (1/1) ... [2025-02-06 12:57:12,119 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 2, 5, 5, 5]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 0, 5, 5, 5]. The 1 writes are split as follows [0, 1, 0, 0, 0]. [2025-02-06 12:57:12,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (1/1) ... [2025-02-06 12:57:12,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (1/1) ... [2025-02-06 12:57:12,125 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (1/1) ... [2025-02-06 12:57:12,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (1/1) ... [2025-02-06 12:57:12,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (1/1) ... [2025-02-06 12:57:12,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (1/1) ... [2025-02-06 12:57:12,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:57:12,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:57:12,133 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:57:12,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:57:12,134 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (1/1) ... [2025-02-06 12:57:12,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:57:12,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:57:12,170 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:57:12,174 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:57:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:57:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:57:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:57:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 12:57:12,192 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:57:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 12:57:12,193 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:57:12,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:57:12,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:57:12,194 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:57:12,317 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:57:12,319 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:57:12,521 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 12:57:12,521 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 12:57:12,559 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:57:12,559 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:57:12,731 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:57:12,731 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:57:12,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:57:12 BoogieIcfgContainer [2025-02-06 12:57:12,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:57:12,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:57:12,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:57:12,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:57:12,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:57:11" (1/3) ... [2025-02-06 12:57:12,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd1b460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:57:12, skipping insertion in model container [2025-02-06 12:57:12,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:12" (2/3) ... [2025-02-06 12:57:12,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd1b460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:57:12, skipping insertion in model container [2025-02-06 12:57:12,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:57:12" (3/3) ... [2025-02-06 12:57:12,744 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2025-02-06 12:57:12,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:57:12,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_19-callback_racing.i that has 2 procedures, 55 locations, 1 initial locations, 7 loop locations, and 6 error locations. [2025-02-06 12:57:12,757 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:57:12,819 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 12:57:12,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 68 transitions, 143 flow [2025-02-06 12:57:12,905 INFO L124 PetriNetUnfolderBase]: 21/109 cut-off events. [2025-02-06 12:57:12,906 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:57:12,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 109 events. 21/109 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 397 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2025-02-06 12:57:12,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 68 transitions, 143 flow [2025-02-06 12:57:12,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 68 transitions, 143 flow [2025-02-06 12:57:12,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:57:12,943 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;@2bcb0e21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:57:12,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:57:12,947 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:57:12,947 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:57:12,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:57:12,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:12,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:57:12,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-02-06 12:57:12,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:12,954 INFO L85 PathProgramCache]: Analyzing trace with hash 366200, now seen corresponding path program 1 times [2025-02-06 12:57:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:12,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051942483] [2025-02-06 12:57:12,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:13,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:57:13,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:57:13,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:13,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:13,199 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:57:13,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:13,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051942483] [2025-02-06 12:57:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051942483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:57:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361468554] [2025-02-06 12:57:13,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:13,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:57:13,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:13,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:57:13,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:57:13,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-02-06 12:57:13,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 68 transitions, 143 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:57:13,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:13,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-02-06 12:57:13,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:13,497 INFO L124 PetriNetUnfolderBase]: 173/531 cut-off events. [2025-02-06 12:57:13,497 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:57:13,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 531 events. 173/531 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2891 event pairs, 136 based on Foata normal form. 133/623 useless extension candidates. Maximal degree in co-relation 840. Up to 337 conditions per place. [2025-02-06 12:57:13,508 INFO L140 encePairwiseOnDemand]: 54/68 looper letters, 39 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-02-06 12:57:13,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 215 flow [2025-02-06 12:57:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:57:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:57:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-02-06 12:57:13,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2025-02-06 12:57:13,525 INFO L175 Difference]: Start difference. First operand has 58 places, 68 transitions, 143 flow. Second operand 3 states and 123 transitions. [2025-02-06 12:57:13,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 215 flow [2025-02-06 12:57:13,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:57:13,534 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 121 flow [2025-02-06 12:57:13,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2025-02-06 12:57:13,540 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2025-02-06 12:57:13,541 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 121 flow [2025-02-06 12:57:13,541 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:57:13,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:13,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:57:13,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:57:13,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-02-06 12:57:13,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash 366201, now seen corresponding path program 1 times [2025-02-06 12:57:13,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:13,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790318553] [2025-02-06 12:57:13,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:13,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:13,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:57:13,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:57:13,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:13,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:13,731 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:57:13,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:13,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790318553] [2025-02-06 12:57:13,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790318553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:13,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:13,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:57:13,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142573870] [2025-02-06 12:57:13,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:13,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:57:13,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:13,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:57:13,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:57:13,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 68 [2025-02-06 12:57:13,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 121 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:57:13,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:13,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 68 [2025-02-06 12:57:13,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:13,885 INFO L124 PetriNetUnfolderBase]: 162/475 cut-off events. [2025-02-06 12:57:13,886 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-06 12:57:13,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 475 events. 162/475 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2539 event pairs, 34 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 796. Up to 329 conditions per place. [2025-02-06 12:57:13,888 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 39 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-02-06 12:57:13,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 221 flow [2025-02-06 12:57:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:57:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:57:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-02-06 12:57:13,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-02-06 12:57:13,890 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 121 flow. Second operand 3 states and 118 transitions. [2025-02-06 12:57:13,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 221 flow [2025-02-06 12:57:13,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:57:13,892 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 127 flow [2025-02-06 12:57:13,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2025-02-06 12:57:13,893 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2025-02-06 12:57:13,893 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 127 flow [2025-02-06 12:57:13,893 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:57:13,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:13,893 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 12:57:13,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:57:13,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-02-06 12:57:13,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1098288871, now seen corresponding path program 1 times [2025-02-06 12:57:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:13,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289051926] [2025-02-06 12:57:13,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:13,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:13,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:57:13,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:57:13,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:13,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:14,058 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:57:14,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:14,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289051926] [2025-02-06 12:57:14,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289051926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:14,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:14,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:57:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283562634] [2025-02-06 12:57:14,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:14,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:57:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:14,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:57:14,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:57:14,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-02-06 12:57:14,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 127 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:57:14,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:14,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-02-06 12:57:14,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:14,139 INFO L124 PetriNetUnfolderBase]: 24/93 cut-off events. [2025-02-06 12:57:14,139 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 12:57:14,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 93 events. 24/93 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 261 event pairs, 16 based on Foata normal form. 18/110 useless extension candidates. Maximal degree in co-relation 163. Up to 51 conditions per place. [2025-02-06 12:57:14,140 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 21 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-02-06 12:57:14,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 120 flow [2025-02-06 12:57:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:57:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:57:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-02-06 12:57:14,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44485294117647056 [2025-02-06 12:57:14,142 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 127 flow. Second operand 4 states and 121 transitions. [2025-02-06 12:57:14,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 120 flow [2025-02-06 12:57:14,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:57:14,142 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 52 flow [2025-02-06 12:57:14,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-02-06 12:57:14,143 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -30 predicate places. [2025-02-06 12:57:14,143 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 52 flow [2025-02-06 12:57:14,143 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:57:14,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:14,143 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 12:57:14,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:57:14,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-02-06 12:57:14,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash 312783685, now seen corresponding path program 1 times [2025-02-06 12:57:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:14,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617505038] [2025-02-06 12:57:14,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:14,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:14,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:57:14,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:57:14,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:14,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:57:14,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:57:14,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:57:14,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:57:14,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:14,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:57:14,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:57:14,189 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:57:14,190 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-06 12:57:14,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-02-06 12:57:14,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-02-06 12:57:14,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2025-02-06 12:57:14,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2025-02-06 12:57:14,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-02-06 12:57:14,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-02-06 12:57:14,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-06 12:57:14,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:57:14,194 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 12:57:14,196 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:57:14,196 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:57:14,215 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:57:14,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 91 transitions, 198 flow [2025-02-06 12:57:14,230 INFO L124 PetriNetUnfolderBase]: 35/185 cut-off events. [2025-02-06 12:57:14,230 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-06 12:57:14,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 185 events. 35/185 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 821 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 113. Up to 9 conditions per place. [2025-02-06 12:57:14,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 91 transitions, 198 flow [2025-02-06 12:57:14,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 91 transitions, 198 flow [2025-02-06 12:57:14,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:57:14,235 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;@2bcb0e21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:57:14,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 12:57:14,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:57:14,236 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:57:14,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:57:14,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:14,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:57:14,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 12:57:14,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash 456563, now seen corresponding path program 1 times [2025-02-06 12:57:14,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:14,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684649256] [2025-02-06 12:57:14,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:14,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:14,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:57:14,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:57:14,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:14,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:14,316 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:57:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684649256] [2025-02-06 12:57:14,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684649256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:14,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:14,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:57:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111446257] [2025-02-06 12:57:14,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:14,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:57:14,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:14,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:57:14,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:57:14,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 91 [2025-02-06 12:57:14,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:57:14,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:14,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 91 [2025-02-06 12:57:14,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:14,802 INFO L124 PetriNetUnfolderBase]: 3201/6501 cut-off events. [2025-02-06 12:57:14,803 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-06 12:57:14,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11629 conditions, 6501 events. 3201/6501 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 51169 event pairs, 2688 based on Foata normal form. 2016/8106 useless extension candidates. Maximal degree in co-relation 8206. Up to 4555 conditions per place. [2025-02-06 12:57:14,897 INFO L140 encePairwiseOnDemand]: 73/91 looper letters, 57 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-02-06 12:57:14,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 312 flow [2025-02-06 12:57:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:57:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:57:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2025-02-06 12:57:14,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6336996336996337 [2025-02-06 12:57:14,898 INFO L175 Difference]: Start difference. First operand has 78 places, 91 transitions, 198 flow. Second operand 3 states and 173 transitions. [2025-02-06 12:57:14,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 312 flow [2025-02-06 12:57:14,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 89 transitions, 312 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:57:14,900 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 166 flow [2025-02-06 12:57:14,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2025-02-06 12:57:14,901 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2025-02-06 12:57:14,901 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 166 flow [2025-02-06 12:57:14,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:57:14,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:14,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:57:14,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:57:14,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 12:57:14,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash 456564, now seen corresponding path program 1 times [2025-02-06 12:57:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441768751] [2025-02-06 12:57:14,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:14,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:57:14,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:57:14,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:14,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:14,960 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:57:14,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441768751] [2025-02-06 12:57:14,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441768751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:14,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:14,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:57:14,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007864815] [2025-02-06 12:57:14,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:14,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:57:14,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:14,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:57:14,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:57:14,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-02-06 12:57:14,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:57:14,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:14,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-02-06 12:57:14,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:15,435 INFO L124 PetriNetUnfolderBase]: 3038/6311 cut-off events. [2025-02-06 12:57:15,436 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-02-06 12:57:15,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11265 conditions, 6311 events. 3038/6311 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 49921 event pairs, 1328 based on Foata normal form. 1/5908 useless extension candidates. Maximal degree in co-relation 9981. Up to 4789 conditions per place. [2025-02-06 12:57:15,470 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 50 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-02-06 12:57:15,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 83 transitions, 290 flow [2025-02-06 12:57:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:57:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:57:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-02-06 12:57:15,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5604395604395604 [2025-02-06 12:57:15,472 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 166 flow. Second operand 3 states and 153 transitions. [2025-02-06 12:57:15,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 83 transitions, 290 flow [2025-02-06 12:57:15,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 83 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:57:15,476 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 176 flow [2025-02-06 12:57:15,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=77, PETRI_TRANSITIONS=74} [2025-02-06 12:57:15,476 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-02-06 12:57:15,476 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 176 flow [2025-02-06 12:57:15,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:57:15,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:15,477 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 12:57:15,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:57:15,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 12:57:15,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:15,477 INFO L85 PathProgramCache]: Analyzing trace with hash 752887583, now seen corresponding path program 1 times [2025-02-06 12:57:15,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:15,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369008546] [2025-02-06 12:57:15,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:15,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:15,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:57:15,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:57:15,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:15,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:15,575 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:57:15,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369008546] [2025-02-06 12:57:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369008546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:15,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:15,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:57:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103330668] [2025-02-06 12:57:15,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:15,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:57:15,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:15,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:57:15,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:57:15,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-02-06 12:57:15,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 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:57:15,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:15,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-02-06 12:57:15,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:16,019 INFO L124 PetriNetUnfolderBase]: 3030/6285 cut-off events. [2025-02-06 12:57:16,019 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2025-02-06 12:57:16,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11393 conditions, 6285 events. 3030/6285 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 49933 event pairs, 1099 based on Foata normal form. 9/5991 useless extension candidates. Maximal degree in co-relation 1656. Up to 4585 conditions per place. [2025-02-06 12:57:16,054 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 66 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2025-02-06 12:57:16,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 101 transitions, 372 flow [2025-02-06 12:57:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:57:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:57:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-02-06 12:57:16,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2025-02-06 12:57:16,056 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 176 flow. Second operand 4 states and 203 transitions. [2025-02-06 12:57:16,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 101 transitions, 372 flow [2025-02-06 12:57:16,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 101 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:57:16,059 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 193 flow [2025-02-06 12:57:16,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2025-02-06 12:57:16,061 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 2 predicate places. [2025-02-06 12:57:16,062 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 193 flow [2025-02-06 12:57:16,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 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:57:16,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:16,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:57:16,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:57:16,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 12:57:16,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1970525675, now seen corresponding path program 1 times [2025-02-06 12:57:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:16,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170633069] [2025-02-06 12:57:16,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:16,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:16,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:57:16,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:57:16,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:16,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:16,108 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:57:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170633069] [2025-02-06 12:57:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170633069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:16,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:16,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:57:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714433331] [2025-02-06 12:57:16,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:16,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:57:16,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:16,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:57:16,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:57:16,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 91 [2025-02-06 12:57:16,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:57:16,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:16,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 91 [2025-02-06 12:57:16,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:16,460 INFO L124 PetriNetUnfolderBase]: 2763/5786 cut-off events. [2025-02-06 12:57:16,461 INFO L125 PetriNetUnfolderBase]: For 559/559 co-relation queries the response was YES. [2025-02-06 12:57:16,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10755 conditions, 5786 events. 2763/5786 cut-off events. For 559/559 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 46443 event pairs, 71 based on Foata normal form. 9/5491 useless extension candidates. Maximal degree in co-relation 7971. Up to 4129 conditions per place. [2025-02-06 12:57:16,483 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 65 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2025-02-06 12:57:16,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 100 transitions, 374 flow [2025-02-06 12:57:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:57:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:57:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-02-06 12:57:16,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5631868131868132 [2025-02-06 12:57:16,484 INFO L175 Difference]: Start difference. First operand has 80 places, 75 transitions, 193 flow. Second operand 4 states and 205 transitions. [2025-02-06 12:57:16,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 100 transitions, 374 flow [2025-02-06 12:57:16,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 100 transitions, 368 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:57:16,487 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 186 flow [2025-02-06 12:57:16,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2025-02-06 12:57:16,488 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2025-02-06 12:57:16,488 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 186 flow [2025-02-06 12:57:16,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:57:16,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:16,488 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-06 12:57:16,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:57:16,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 12:57:16,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:16,489 INFO L85 PathProgramCache]: Analyzing trace with hash -453771863, now seen corresponding path program 1 times [2025-02-06 12:57:16,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:16,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285592568] [2025-02-06 12:57:16,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:16,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:16,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:57:16,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:57:16,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:16,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:16,601 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:57:16,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:16,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285592568] [2025-02-06 12:57:16,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285592568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:16,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:16,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:57:16,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265995072] [2025-02-06 12:57:16,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:16,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:57:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:16,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:57:16,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:57:16,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-02-06 12:57:16,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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:57:16,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:16,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-02-06 12:57:16,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:17,157 INFO L124 PetriNetUnfolderBase]: 2763/5689 cut-off events. [2025-02-06 12:57:17,157 INFO L125 PetriNetUnfolderBase]: For 769/769 co-relation queries the response was YES. [2025-02-06 12:57:17,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10424 conditions, 5689 events. 2763/5689 cut-off events. For 769/769 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 44756 event pairs, 64 based on Foata normal form. 81/5479 useless extension candidates. Maximal degree in co-relation 1482. Up to 3679 conditions per place. [2025-02-06 12:57:17,173 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 80 selfloop transitions, 4 changer transitions 0/115 dead transitions. [2025-02-06 12:57:17,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 115 transitions, 432 flow [2025-02-06 12:57:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:57:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:57:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2025-02-06 12:57:17,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5494505494505495 [2025-02-06 12:57:17,175 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 186 flow. Second operand 5 states and 250 transitions. [2025-02-06 12:57:17,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 115 transitions, 432 flow [2025-02-06 12:57:17,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 115 transitions, 426 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:57:17,176 INFO L231 Difference]: Finished difference. Result has 81 places, 73 transitions, 182 flow [2025-02-06 12:57:17,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2025-02-06 12:57:17,177 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2025-02-06 12:57:17,177 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 182 flow [2025-02-06 12:57:17,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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:57:17,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:17,177 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-02-06 12:57:17,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:57:17,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 12:57:17,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:17,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1182025435, now seen corresponding path program 1 times [2025-02-06 12:57:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:17,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136783729] [2025-02-06 12:57:17,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:17,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:57:17,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:57:17,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:17,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:57:17,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:57:17,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:57:17,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:57:17,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:17,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:57:17,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:57:17,196 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:57:17,196 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-06 12:57:17,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-02-06 12:57:17,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-02-06 12:57:17,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-02-06 12:57:17,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-02-06 12:57:17,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-02-06 12:57:17,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-02-06 12:57:17,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-02-06 12:57:17,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-02-06 12:57:17,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:57:17,197 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 12:57:17,197 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:57:17,197 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:57:17,209 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 12:57:17,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 114 transitions, 255 flow [2025-02-06 12:57:17,220 INFO L124 PetriNetUnfolderBase]: 52/282 cut-off events. [2025-02-06 12:57:17,221 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-02-06 12:57:17,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 282 events. 52/282 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1362 event pairs, 1 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 196. Up to 12 conditions per place. [2025-02-06 12:57:17,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 114 transitions, 255 flow [2025-02-06 12:57:17,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 114 transitions, 255 flow [2025-02-06 12:57:17,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:57:17,223 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;@2bcb0e21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:57:17,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 12:57:17,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:57:17,224 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:57:17,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:57:17,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:17,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:57:17,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:57:17,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash 569765, now seen corresponding path program 1 times [2025-02-06 12:57:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:17,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489335257] [2025-02-06 12:57:17,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:17,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:17,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:57:17,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:57:17,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:17,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:17,242 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:57:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489335257] [2025-02-06 12:57:17,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489335257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:17,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:17,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:57:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486900071] [2025-02-06 12:57:17,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:17,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:57:17,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:17,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:57:17,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:57:17,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 114 [2025-02-06 12:57:17,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 114 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:57:17,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:17,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 114 [2025-02-06 12:57:17,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:21,183 INFO L124 PetriNetUnfolderBase]: 44624/74495 cut-off events. [2025-02-06 12:57:21,183 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES. [2025-02-06 12:57:21,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137167 conditions, 74495 events. 44624/74495 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 2236. Compared 684499 event pairs, 38073 based on Foata normal form. 25863/96384 useless extension candidates. Maximal degree in co-relation 42480. Up to 55214 conditions per place. [2025-02-06 12:57:21,574 INFO L140 encePairwiseOnDemand]: 92/114 looper letters, 75 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-02-06 12:57:21,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 115 transitions, 411 flow [2025-02-06 12:57:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:57:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:57:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2025-02-06 12:57:21,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.652046783625731 [2025-02-06 12:57:21,577 INFO L175 Difference]: Start difference. First operand has 98 places, 114 transitions, 255 flow. Second operand 3 states and 223 transitions. [2025-02-06 12:57:21,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 115 transitions, 411 flow [2025-02-06 12:57:21,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 115 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:57:21,580 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 213 flow [2025-02-06 12:57:21,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2025-02-06 12:57:21,582 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -3 predicate places. [2025-02-06 12:57:21,582 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 213 flow [2025-02-06 12:57:21,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:57:21,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:21,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:57:21,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:57:21,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:57:21,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash 569766, now seen corresponding path program 1 times [2025-02-06 12:57:21,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:21,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629021174] [2025-02-06 12:57:21,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:21,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:57:21,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:57:21,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:21,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:21,639 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:57:21,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:21,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629021174] [2025-02-06 12:57:21,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629021174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:21,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:21,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:57:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590878648] [2025-02-06 12:57:21,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:21,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:57:21,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:21,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:57:21,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:57:21,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 114 [2025-02-06 12:57:21,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:21,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:21,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 114 [2025-02-06 12:57:21,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:25,730 INFO L124 PetriNetUnfolderBase]: 42221/71897 cut-off events. [2025-02-06 12:57:25,731 INFO L125 PetriNetUnfolderBase]: For 2045/2055 co-relation queries the response was YES. [2025-02-06 12:57:25,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132155 conditions, 71897 events. 42221/71897 cut-off events. For 2045/2055 co-relation queries the response was YES. Maximal size of possible extension queue 2131. Compared 666413 event pairs, 26281 based on Foata normal form. 1/67978 useless extension candidates. Maximal degree in co-relation 116178. Up to 58588 conditions per place. [2025-02-06 12:57:26,229 INFO L140 encePairwiseOnDemand]: 110/114 looper letters, 60 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-02-06 12:57:26,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 101 transitions, 357 flow [2025-02-06 12:57:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:57:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:57:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-02-06 12:57:26,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5467836257309941 [2025-02-06 12:57:26,231 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 213 flow. Second operand 3 states and 187 transitions. [2025-02-06 12:57:26,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 101 transitions, 357 flow [2025-02-06 12:57:26,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 101 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:57:26,272 INFO L231 Difference]: Finished difference. Result has 96 places, 92 transitions, 223 flow [2025-02-06 12:57:26,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=93, 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=96, PETRI_TRANSITIONS=92} [2025-02-06 12:57:26,273 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -2 predicate places. [2025-02-06 12:57:26,273 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 223 flow [2025-02-06 12:57:26,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:26,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:26,274 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 12:57:26,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:57:26,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:57:26,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2072735588, now seen corresponding path program 1 times [2025-02-06 12:57:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:26,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583730330] [2025-02-06 12:57:26,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:26,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:57:26,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:57:26,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:26,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:26,360 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:57:26,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:26,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583730330] [2025-02-06 12:57:26,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583730330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:26,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:26,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:57:26,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501913245] [2025-02-06 12:57:26,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:26,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:57:26,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:26,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:57:26,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:57:26,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 114 [2025-02-06 12:57:26,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:57:26,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:26,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 114 [2025-02-06 12:57:26,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:30,143 INFO L124 PetriNetUnfolderBase]: 42213/72405 cut-off events. [2025-02-06 12:57:30,144 INFO L125 PetriNetUnfolderBase]: For 3705/3724 co-relation queries the response was YES. [2025-02-06 12:57:30,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134104 conditions, 72405 events. 42213/72405 cut-off events. For 3705/3724 co-relation queries the response was YES. Maximal size of possible extension queue 2136. Compared 680607 event pairs, 12361 based on Foata normal form. 9/69455 useless extension candidates. Maximal degree in co-relation 134028. Up to 58384 conditions per place. [2025-02-06 12:57:30,532 INFO L140 encePairwiseOnDemand]: 110/114 looper letters, 77 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-02-06 12:57:30,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 120 transitions, 445 flow [2025-02-06 12:57:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:57:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:57:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-02-06 12:57:30,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-02-06 12:57:30,534 INFO L175 Difference]: Start difference. First operand has 96 places, 92 transitions, 223 flow. Second operand 4 states and 246 transitions. [2025-02-06 12:57:30,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 120 transitions, 445 flow [2025-02-06 12:57:30,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 120 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:57:30,537 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 246 flow [2025-02-06 12:57:30,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=95, 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=99, PETRI_TRANSITIONS=94} [2025-02-06 12:57:30,537 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2025-02-06 12:57:30,537 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 246 flow [2025-02-06 12:57:30,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:57:30,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:30,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:57:30,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:57:30,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:57:30,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:30,538 INFO L85 PathProgramCache]: Analyzing trace with hash 965993064, now seen corresponding path program 1 times [2025-02-06 12:57:30,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:30,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573785438] [2025-02-06 12:57:30,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:30,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:57:30,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:57:30,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:30,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:30,569 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:57:30,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:30,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573785438] [2025-02-06 12:57:30,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573785438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:30,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:30,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:57:30,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116619292] [2025-02-06 12:57:30,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:30,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:57:30,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:30,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:57:30,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:57:30,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 114 [2025-02-06 12:57:30,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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:57:30,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:30,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 114 [2025-02-06 12:57:30,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:34,846 INFO L124 PetriNetUnfolderBase]: 40002/68485 cut-off events. [2025-02-06 12:57:34,849 INFO L125 PetriNetUnfolderBase]: For 6004/6004 co-relation queries the response was YES. [2025-02-06 12:57:34,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128107 conditions, 68485 events. 40002/68485 cut-off events. For 6004/6004 co-relation queries the response was YES. Maximal size of possible extension queue 1998. Compared 631518 event pairs, 23261 based on Foata normal form. 9/65562 useless extension candidates. Maximal degree in co-relation 15544. Up to 55255 conditions per place. [2025-02-06 12:57:35,175 INFO L140 encePairwiseOnDemand]: 111/114 looper letters, 76 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-02-06 12:57:35,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 119 transitions, 449 flow [2025-02-06 12:57:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:57:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:57:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 248 transitions. [2025-02-06 12:57:35,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2025-02-06 12:57:35,184 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 246 flow. Second operand 4 states and 248 transitions. [2025-02-06 12:57:35,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 119 transitions, 449 flow [2025-02-06 12:57:35,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 119 transitions, 443 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:57:35,190 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 239 flow [2025-02-06 12:57:35,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=97, 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=239, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2025-02-06 12:57:35,192 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 2 predicate places. [2025-02-06 12:57:35,192 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 239 flow [2025-02-06 12:57:35,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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:57:35,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:35,192 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-06 12:57:35,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:57:35,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:57:35,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash 558659825, now seen corresponding path program 1 times [2025-02-06 12:57:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:35,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952668852] [2025-02-06 12:57:35,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:35,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:57:35,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:57:35,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:35,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:35,302 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:57:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952668852] [2025-02-06 12:57:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952668852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:35,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:57:35,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705267547] [2025-02-06 12:57:35,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:35,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:57:35,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:57:35,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:57:35,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 114 [2025-02-06 12:57:35,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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:57:35,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:35,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 114 [2025-02-06 12:57:35,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:39,251 INFO L124 PetriNetUnfolderBase]: 41946/72106 cut-off events. [2025-02-06 12:57:39,251 INFO L125 PetriNetUnfolderBase]: For 7781/7781 co-relation queries the response was YES. [2025-02-06 12:57:39,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135619 conditions, 72106 events. 41946/72106 cut-off events. For 7781/7781 co-relation queries the response was YES. Maximal size of possible extension queue 2130. Compared 678397 event pairs, 10261 based on Foata normal form. 81/69328 useless extension candidates. Maximal degree in co-relation 11651. Up to 55453 conditions per place. [2025-02-06 12:57:39,769 INFO L140 encePairwiseOnDemand]: 110/114 looper letters, 101 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2025-02-06 12:57:39,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 145 transitions, 559 flow [2025-02-06 12:57:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:57:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:57:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 312 transitions. [2025-02-06 12:57:39,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5473684210526316 [2025-02-06 12:57:39,770 INFO L175 Difference]: Start difference. First operand has 100 places, 93 transitions, 239 flow. Second operand 5 states and 312 transitions. [2025-02-06 12:57:39,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 145 transitions, 559 flow [2025-02-06 12:57:39,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 145 transitions, 553 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:57:39,774 INFO L231 Difference]: Finished difference. Result has 102 places, 94 transitions, 256 flow [2025-02-06 12:57:39,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2025-02-06 12:57:39,775 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2025-02-06 12:57:39,775 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 256 flow [2025-02-06 12:57:39,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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:57:39,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:39,775 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:57:39,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:57:39,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:57:39,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1247613, now seen corresponding path program 1 times [2025-02-06 12:57:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:39,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173507401] [2025-02-06 12:57:39,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:39,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:57:39,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:57:39,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:39,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:39,799 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:57:39,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:39,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173507401] [2025-02-06 12:57:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173507401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:39,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:39,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:57:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046001088] [2025-02-06 12:57:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:39,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:57:39,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:39,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:57:39,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:57:39,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 114 [2025-02-06 12:57:39,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:57:39,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:39,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 114 [2025-02-06 12:57:39,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:57:46,071 INFO L124 PetriNetUnfolderBase]: 65868/110948 cut-off events. [2025-02-06 12:57:46,071 INFO L125 PetriNetUnfolderBase]: For 10789/10841 co-relation queries the response was YES. [2025-02-06 12:57:46,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208428 conditions, 110948 events. 65868/110948 cut-off events. For 10789/10841 co-relation queries the response was YES. Maximal size of possible extension queue 3067. Compared 1074191 event pairs, 38282 based on Foata normal form. 0/107031 useless extension candidates. Maximal degree in co-relation 114060. Up to 55453 conditions per place. [2025-02-06 12:57:46,641 INFO L140 encePairwiseOnDemand]: 111/114 looper letters, 88 selfloop transitions, 3 changer transitions 0/131 dead transitions. [2025-02-06 12:57:46,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 131 transitions, 512 flow [2025-02-06 12:57:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:57:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:57:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2025-02-06 12:57:46,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6286549707602339 [2025-02-06 12:57:46,643 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 256 flow. Second operand 3 states and 215 transitions. [2025-02-06 12:57:46,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 131 transitions, 512 flow [2025-02-06 12:57:46,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 131 transitions, 497 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-06 12:57:46,649 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 256 flow [2025-02-06 12:57:46,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2025-02-06 12:57:46,650 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2025-02-06 12:57:46,650 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 256 flow [2025-02-06 12:57:46,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:57:46,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:57:46,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:57:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:57:46,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:57:46,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:57:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2046410904, now seen corresponding path program 1 times [2025-02-06 12:57:46,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:57:46,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093185913] [2025-02-06 12:57:46,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:57:46,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:57:46,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:57:46,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:57:46,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:57:46,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:57:46,730 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:57:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:57:46,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093185913] [2025-02-06 12:57:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093185913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:57:46,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:57:46,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:57:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892282870] [2025-02-06 12:57:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:57:46,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:57:46,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:57:46,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:57:46,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:57:46,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 114 [2025-02-06 12:57:46,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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:57:46,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:57:46,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 114 [2025-02-06 12:57:46,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand