./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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_61-invariant_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 b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:58:56,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:58:56,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:58:56,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:58:56,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:58:56,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:58:56,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:58:56,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:58:56,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:58:56,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:58:56,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:58:56,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:58:56,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:58:56,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:58:56,567 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:58:56,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:58:56,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:56,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:56,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:56,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:58:56,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:58:56,569 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 -> b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 [2025-01-10 00:58:56,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:58:56,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:58:56,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:58:56,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:58:56,776 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:58:56,777 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_61-invariant_racing.i [2025-01-10 00:58:57,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/faadb5f03/017eacf2d46d44c5992bf71559d6f6ee/FLAGc94736977 [2025-01-10 00:58:58,372 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:58:58,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2025-01-10 00:58:58,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/faadb5f03/017eacf2d46d44c5992bf71559d6f6ee/FLAGc94736977 [2025-01-10 00:58:58,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/faadb5f03/017eacf2d46d44c5992bf71559d6f6ee [2025-01-10 00:58:58,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:58:58,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:58:58,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:58,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:58:58,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:58:58,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1706abb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58, skipping insertion in model container [2025-01-10 00:58:58,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:58:58,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:58:58,806 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:58:58,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:58:58,882 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:58:58,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58 WrapperNode [2025-01-10 00:58:58,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:58,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:58:58,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:58:58,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:58:58,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,915 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2025-01-10 00:58:58,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:58:58,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:58:58,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:58:58,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:58:58,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,939 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 5, 5]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 5, 5]. The 1 writes are split as follows [0, 1, 0, 0]. [2025-01-10 00:58:58,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:58:58,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:58:58,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:58:58,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:58:58,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (1/1) ... [2025-01-10 00:58:58,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:58,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:58:58,994 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-01-10 00:58:59,008 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-01-10 00:58:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:58:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:58:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:58:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:58:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:58:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:58:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:58:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:58:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:58:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:58:59,028 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:58:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:58:59,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:58:59,030 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:58:59,134 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:58:59,135 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:58:59,333 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:58:59,333 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:58:59,415 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:58:59,415 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-10 00:58:59,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:58:59 BoogieIcfgContainer [2025-01-10 00:58:59,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:58:59,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:58:59,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:58:59,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:58:59,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:58:58" (1/3) ... [2025-01-10 00:58:59,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328305d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:58:59, skipping insertion in model container [2025-01-10 00:58:59,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:58" (2/3) ... [2025-01-10 00:58:59,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328305d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:58:59, skipping insertion in model container [2025-01-10 00:58:59,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:58:59" (3/3) ... [2025-01-10 00:58:59,422 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing.i [2025-01-10 00:58:59,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:58:59,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_61-invariant_racing.i that has 2 procedures, 71 locations, 1 initial locations, 9 loop locations, and 6 error locations. [2025-01-10 00:58:59,432 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:58:59,460 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:58:59,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 89 transitions, 185 flow [2025-01-10 00:58:59,509 INFO L124 PetriNetUnfolderBase]: 28/138 cut-off events. [2025-01-10 00:58:59,510 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:58:59,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 138 events. 28/138 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 524 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 84. Up to 6 conditions per place. [2025-01-10 00:58:59,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 89 transitions, 185 flow [2025-01-10 00:58:59,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 89 transitions, 185 flow [2025-01-10 00:58:59,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:59,527 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;@302a495d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:59,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:58:59,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:59,549 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:58:59,549 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:59,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:59,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:59,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:58:59,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:59,554 INFO L85 PathProgramCache]: Analyzing trace with hash 427170, now seen corresponding path program 1 times [2025-01-10 00:58:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32251240] [2025-01-10 00:58:59,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:59,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:59,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:59,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:59,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32251240] [2025-01-10 00:58:59,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32251240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:59,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:59,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365636066] [2025-01-10 00:58:59,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:59,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:59,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:59,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:59,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:59,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 89 [2025-01-10 00:58:59,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 89 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:59,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:59,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 89 [2025-01-10 00:58:59,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:59,982 INFO L124 PetriNetUnfolderBase]: 296/916 cut-off events. [2025-01-10 00:58:59,982 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:58:59,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 916 events. 296/916 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5672 event pairs, 247 based on Foata normal form. 189/1067 useless extension candidates. Maximal degree in co-relation 1468. Up to 567 conditions per place. [2025-01-10 00:58:59,991 INFO L140 encePairwiseOnDemand]: 69/89 looper letters, 48 selfloop transitions, 2 changer transitions 1/83 dead transitions. [2025-01-10 00:58:59,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 83 transitions, 275 flow [2025-01-10 00:58:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2025-01-10 00:59:00,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6404494382022472 [2025-01-10 00:59:00,004 INFO L175 Difference]: Start difference. First operand has 74 places, 89 transitions, 185 flow. Second operand 3 states and 171 transitions. [2025-01-10 00:59:00,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 83 transitions, 275 flow [2025-01-10 00:59:00,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:00,012 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 149 flow [2025-01-10 00:59:00,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-01-10 00:59:00,018 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2025-01-10 00:59:00,018 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 149 flow [2025-01-10 00:59:00,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:00,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:00,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:59:00,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:59:00,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:59:00,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:00,020 INFO L85 PathProgramCache]: Analyzing trace with hash 427171, now seen corresponding path program 1 times [2025-01-10 00:59:00,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:00,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886161410] [2025-01-10 00:59:00,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:00,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:00,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:59:00,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:59:00,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:00,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:00,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:00,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886161410] [2025-01-10 00:59:00,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886161410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:00,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:00,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:00,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736676781] [2025-01-10 00:59:00,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:00,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:00,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:00,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:00,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:00,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 89 [2025-01-10 00:59:00,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:00,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:00,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 89 [2025-01-10 00:59:00,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:00,330 INFO L124 PetriNetUnfolderBase]: 267/851 cut-off events. [2025-01-10 00:59:00,331 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:59:00,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 851 events. 267/851 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5024 event pairs, 234 based on Foata normal form. 1/795 useless extension candidates. Maximal degree in co-relation 1394. Up to 532 conditions per place. [2025-01-10 00:59:00,337 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 48 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-01-10 00:59:00,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 277 flow [2025-01-10 00:59:00,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-01-10 00:59:00,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5880149812734082 [2025-01-10 00:59:00,338 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 149 flow. Second operand 3 states and 157 transitions. [2025-01-10 00:59:00,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 277 flow [2025-01-10 00:59:00,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 83 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:00,341 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 155 flow [2025-01-10 00:59:00,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-01-10 00:59:00,341 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2025-01-10 00:59:00,341 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 155 flow [2025-01-10 00:59:00,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:00,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:00,344 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:59:00,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:59:00,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:59:00,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash -622625271, now seen corresponding path program 1 times [2025-01-10 00:59:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034377837] [2025-01-10 00:59:00,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:00,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:59:00,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:59:00,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:00,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034377837] [2025-01-10 00:59:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034377837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:00,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:00,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:59:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651853019] [2025-01-10 00:59:00,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:00,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:59:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:00,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:59:00,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:59:00,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 00:59:00,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-01-10 00:59:00,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:00,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 00:59:00,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:00,625 INFO L124 PetriNetUnfolderBase]: 43/156 cut-off events. [2025-01-10 00:59:00,629 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-10 00:59:00,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 156 events. 43/156 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 474 event pairs, 26 based on Foata normal form. 28/174 useless extension candidates. Maximal degree in co-relation 266. Up to 82 conditions per place. [2025-01-10 00:59:00,630 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 31 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-01-10 00:59:00,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 174 flow [2025-01-10 00:59:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:59:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:59:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2025-01-10 00:59:00,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803370786516854 [2025-01-10 00:59:00,635 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 155 flow. Second operand 4 states and 171 transitions. [2025-01-10 00:59:00,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 174 flow [2025-01-10 00:59:00,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:59:00,637 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 76 flow [2025-01-10 00:59:00,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-01-10 00:59:00,637 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, -35 predicate places. [2025-01-10 00:59:00,638 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 76 flow [2025-01-10 00:59:00,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-01-10 00:59:00,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:00,638 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 00:59:00,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:59:00,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:59:00,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2121513796, now seen corresponding path program 1 times [2025-01-10 00:59:00,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:00,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493352586] [2025-01-10 00:59:00,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:00,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:00,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:00,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:00,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:00,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:00,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:59:00,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:00,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:00,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:00,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:00,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:59:00,686 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:59:00,687 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-10 00:59:00,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-01-10 00:59:00,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-01-10 00:59:00,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-01-10 00:59:00,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-01-10 00:59:00,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 00:59:00,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:59:00,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:59:00,690 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:59:00,691 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:59:00,692 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:59:00,708 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:59:00,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 125 transitions, 266 flow [2025-01-10 00:59:00,723 INFO L124 PetriNetUnfolderBase]: 47/235 cut-off events. [2025-01-10 00:59:00,723 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-10 00:59:00,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 235 events. 47/235 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1083 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 142. Up to 9 conditions per place. [2025-01-10 00:59:00,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 125 transitions, 266 flow [2025-01-10 00:59:00,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 125 transitions, 266 flow [2025-01-10 00:59:00,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:00,727 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;@302a495d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:00,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:59:00,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:00,728 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:59:00,728 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:00,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:00,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:59:00,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:59:00,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash 551295, now seen corresponding path program 1 times [2025-01-10 00:59:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909339602] [2025-01-10 00:59:00,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:00,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:59:00,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:59:00,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:00,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:00,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:00,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909339602] [2025-01-10 00:59:00,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909339602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:00,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:00,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439475622] [2025-01-10 00:59:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:00,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:00,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:00,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:00,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:00,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 125 [2025-01-10 00:59:00,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 125 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-01-10 00:59:00,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:00,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 125 [2025-01-10 00:59:00,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:02,160 INFO L124 PetriNetUnfolderBase]: 8837/17944 cut-off events. [2025-01-10 00:59:02,160 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-01-10 00:59:02,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31575 conditions, 17944 events. 8837/17944 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 162596 event pairs, 7397 based on Foata normal form. 3926/21246 useless extension candidates. Maximal degree in co-relation 12844. Up to 12263 conditions per place. [2025-01-10 00:59:02,262 INFO L140 encePairwiseOnDemand]: 99/125 looper letters, 76 selfloop transitions, 2 changer transitions 1/126 dead transitions. [2025-01-10 00:59:02,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 126 transitions, 426 flow [2025-01-10 00:59:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2025-01-10 00:59:02,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6826666666666666 [2025-01-10 00:59:02,266 INFO L175 Difference]: Start difference. First operand has 104 places, 125 transitions, 266 flow. Second operand 3 states and 256 transitions. [2025-01-10 00:59:02,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 126 transitions, 426 flow [2025-01-10 00:59:02,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 126 transitions, 426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:02,271 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 218 flow [2025-01-10 00:59:02,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2025-01-10 00:59:02,272 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -1 predicate places. [2025-01-10 00:59:02,272 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 218 flow [2025-01-10 00:59:02,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-01-10 00:59:02,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:02,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:59:02,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:59:02,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:59:02,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:02,274 INFO L85 PathProgramCache]: Analyzing trace with hash 551296, now seen corresponding path program 1 times [2025-01-10 00:59:02,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:02,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018757054] [2025-01-10 00:59:02,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:02,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:02,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:59:02,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:59:02,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:02,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:02,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018757054] [2025-01-10 00:59:02,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018757054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:02,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:02,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692338415] [2025-01-10 00:59:02,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:02,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:02,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:02,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:02,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 125 [2025-01-10 00:59:02,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-01-10 00:59:02,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:02,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 125 [2025-01-10 00:59:02,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:03,374 INFO L124 PetriNetUnfolderBase]: 7696/16274 cut-off events. [2025-01-10 00:59:03,376 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-10 00:59:03,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28521 conditions, 16274 events. 7696/16274 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 150806 event pairs, 3497 based on Foata normal form. 1/15509 useless extension candidates. Maximal degree in co-relation 26803. Up to 11927 conditions per place. [2025-01-10 00:59:03,448 INFO L140 encePairwiseOnDemand]: 121/125 looper letters, 64 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-01-10 00:59:03,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 114 transitions, 380 flow [2025-01-10 00:59:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2025-01-10 00:59:03,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813333333333334 [2025-01-10 00:59:03,450 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 218 flow. Second operand 3 states and 218 transitions. [2025-01-10 00:59:03,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 114 transitions, 380 flow [2025-01-10 00:59:03,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 114 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:03,470 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 228 flow [2025-01-10 00:59:03,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2025-01-10 00:59:03,472 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -1 predicate places. [2025-01-10 00:59:03,472 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 228 flow [2025-01-10 00:59:03,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-01-10 00:59:03,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:03,473 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:59:03,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:59:03,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:59:03,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1949837244, now seen corresponding path program 1 times [2025-01-10 00:59:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:03,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647582742] [2025-01-10 00:59:03,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:03,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:03,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:59:03,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:59:03,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:03,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:03,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:03,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647582742] [2025-01-10 00:59:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647582742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:03,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:03,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489146628] [2025-01-10 00:59:03,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:03,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:59:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:03,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:59:03,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:59:03,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 125 [2025-01-10 00:59:03,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-01-10 00:59:03,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:03,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 125 [2025-01-10 00:59:03,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:04,668 INFO L124 PetriNetUnfolderBase]: 7683/16569 cut-off events. [2025-01-10 00:59:04,669 INFO L125 PetriNetUnfolderBase]: For 692/692 co-relation queries the response was YES. [2025-01-10 00:59:04,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29083 conditions, 16569 events. 7683/16569 cut-off events. For 692/692 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 153465 event pairs, 3060 based on Foata normal form. 14/16003 useless extension candidates. Maximal degree in co-relation 2695. Up to 11356 conditions per place. [2025-01-10 00:59:04,754 INFO L140 encePairwiseOnDemand]: 121/125 looper letters, 90 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2025-01-10 00:59:04,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 142 transitions, 502 flow [2025-01-10 00:59:04,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:59:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:59:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2025-01-10 00:59:04,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-01-10 00:59:04,756 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 228 flow. Second operand 4 states and 295 transitions. [2025-01-10 00:59:04,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 142 transitions, 502 flow [2025-01-10 00:59:04,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 142 transitions, 500 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:04,759 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 245 flow [2025-01-10 00:59:04,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=106, PETRI_TRANSITIONS=101} [2025-01-10 00:59:04,759 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 2 predicate places. [2025-01-10 00:59:04,759 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 245 flow [2025-01-10 00:59:04,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-01-10 00:59:04,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:04,760 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-10 00:59:04,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:59:04,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:59:04,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash 954906983, now seen corresponding path program 1 times [2025-01-10 00:59:04,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:04,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885254705] [2025-01-10 00:59:04,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:04,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:59:04,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:59:04,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:04,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:04,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:04,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885254705] [2025-01-10 00:59:04,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885254705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:04,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:04,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:59:04,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752364197] [2025-01-10 00:59:04,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:04,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:59:04,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:04,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:59:04,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:59:04,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 125 [2025-01-10 00:59:04,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 101 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 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-01-10 00:59:04,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:04,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 125 [2025-01-10 00:59:04,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:06,003 INFO L124 PetriNetUnfolderBase]: 7375/15480 cut-off events. [2025-01-10 00:59:06,003 INFO L125 PetriNetUnfolderBase]: For 1226/1226 co-relation queries the response was YES. [2025-01-10 00:59:06,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28025 conditions, 15480 events. 7375/15480 cut-off events. For 1226/1226 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 142337 event pairs, 180 based on Foata normal form. 196/15349 useless extension candidates. Maximal degree in co-relation 24444. Up to 9794 conditions per place. [2025-01-10 00:59:06,063 INFO L140 encePairwiseOnDemand]: 121/125 looper letters, 114 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2025-01-10 00:59:06,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 167 transitions, 611 flow [2025-01-10 00:59:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:59:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:59:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2025-01-10 00:59:06,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.592 [2025-01-10 00:59:06,065 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 245 flow. Second operand 5 states and 370 transitions. [2025-01-10 00:59:06,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 167 transitions, 611 flow [2025-01-10 00:59:06,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 167 transitions, 602 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:06,069 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 240 flow [2025-01-10 00:59:06,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2025-01-10 00:59:06,070 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 3 predicate places. [2025-01-10 00:59:06,070 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 240 flow [2025-01-10 00:59:06,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 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-01-10 00:59:06,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:06,071 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-01-10 00:59:06,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:59:06,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:59:06,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash -462654019, now seen corresponding path program 1 times [2025-01-10 00:59:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:06,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599863142] [2025-01-10 00:59:06,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:06,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:59:06,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:59:06,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:06,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:06,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:59:06,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:59:06,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:59:06,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:06,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:06,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:59:06,103 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:59:06,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:59:06,104 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 00:59:06,104 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:59:06,104 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:59:06,131 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 00:59:06,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 161 transitions, 349 flow [2025-01-10 00:59:06,152 INFO L124 PetriNetUnfolderBase]: 69/353 cut-off events. [2025-01-10 00:59:06,153 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-01-10 00:59:06,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 353 events. 69/353 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1771 event pairs, 1 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 246. Up to 12 conditions per place. [2025-01-10 00:59:06,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 161 transitions, 349 flow [2025-01-10 00:59:06,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 161 transitions, 349 flow [2025-01-10 00:59:06,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:06,159 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;@302a495d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:06,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:59:06,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:06,160 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:59:06,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:06,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:06,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:59:06,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:59:06,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash 711168, now seen corresponding path program 1 times [2025-01-10 00:59:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:06,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661300057] [2025-01-10 00:59:06,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:06,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:59:06,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:59:06,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:06,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:06,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:06,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661300057] [2025-01-10 00:59:06,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661300057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:06,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992890676] [2025-01-10 00:59:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:06,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:06,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:06,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 161 [2025-01-10 00:59:06,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 161 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-01-10 00:59:06,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:06,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 161 [2025-01-10 00:59:06,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:26,288 INFO L124 PetriNetUnfolderBase]: 192014/323708 cut-off events. [2025-01-10 00:59:26,288 INFO L125 PetriNetUnfolderBase]: For 4143/4143 co-relation queries the response was YES. [2025-01-10 00:59:26,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584459 conditions, 323708 events. 192014/323708 cut-off events. For 4143/4143 co-relation queries the response was YES. Maximal size of possible extension queue 6564. Compared 3463507 event pairs, 160330 based on Foata normal form. 73869/387505 useless extension candidates. Maximal degree in co-relation 100250. Up to 233593 conditions per place. [2025-01-10 00:59:28,178 INFO L140 encePairwiseOnDemand]: 129/161 looper letters, 104 selfloop transitions, 2 changer transitions 1/169 dead transitions. [2025-01-10 00:59:28,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 169 transitions, 579 flow [2025-01-10 00:59:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2025-01-10 00:59:28,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7060041407867494 [2025-01-10 00:59:28,180 INFO L175 Difference]: Start difference. First operand has 134 places, 161 transitions, 349 flow. Second operand 3 states and 341 transitions. [2025-01-10 00:59:28,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 169 transitions, 579 flow [2025-01-10 00:59:28,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 169 transitions, 579 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:28,184 INFO L231 Difference]: Finished difference. Result has 133 places, 129 transitions, 289 flow [2025-01-10 00:59:28,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=133, PETRI_TRANSITIONS=129} [2025-01-10 00:59:28,185 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, -1 predicate places. [2025-01-10 00:59:28,185 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 129 transitions, 289 flow [2025-01-10 00:59:28,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-01-10 00:59:28,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:28,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:59:28,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:59:28,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-10 00:59:28,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash 711169, now seen corresponding path program 1 times [2025-01-10 00:59:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:28,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86072319] [2025-01-10 00:59:28,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:28,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:28,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:59:28,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:59:28,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:28,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86072319] [2025-01-10 00:59:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86072319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:28,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:28,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609924008] [2025-01-10 00:59:28,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:28,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:28,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:28,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:28,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 161 [2025-01-10 00:59:28,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 129 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-01-10 00:59:28,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:28,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 161 [2025-01-10 00:59:28,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand