./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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_19-callback_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:58:07,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:58:07,841 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:07,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:58:07,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:58:07,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:58:07,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:58:07,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:58:07,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:58:07,871 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:58:07,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:58:07,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:58:07,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:58:07,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:58:07,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:58:07,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:07,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:07,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:07,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:07,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:07,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:58:07,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:58:07,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:58:07,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:58:07,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:58:07,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:58:07,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:58:07,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:58:07,874 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2025-01-10 00:58:08,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:58:08,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:58:08,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:58:08,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:58:08,132 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:58:08,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-01-10 00:58:09,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4bae7ed4/af22bb830b0e44e1bb5f310052f3e063/FLAG827ce8727 [2025-01-10 00:58:09,581 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:58:09,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-01-10 00:58:09,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4bae7ed4/af22bb830b0e44e1bb5f310052f3e063/FLAG827ce8727 [2025-01-10 00:58:09,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4bae7ed4/af22bb830b0e44e1bb5f310052f3e063 [2025-01-10 00:58:09,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:58:09,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:58:09,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:09,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:58:09,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:58:09,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:09" (1/1) ... [2025-01-10 00:58:09,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2029f000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:09, skipping insertion in model container [2025-01-10 00:58:09,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:09" (1/1) ... [2025-01-10 00:58:09,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:58:09,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:58:09,833 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:58:09,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:58:09,896 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:58:09,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:09 WrapperNode [2025-01-10 00:58:09,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:09,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:58:09,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:58:09,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:58:09,904 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:09" (1/1) ... [2025-01-10 00:58:09,916 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:09" (1/1) ... [2025-01-10 00:58:09,935 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 136 [2025-01-10 00:58:09,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:58:09,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:58:09,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:58:09,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:58:09,945 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:09" (1/1) ... [2025-01-10 00:58:09,945 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:09" (1/1) ... [2025-01-10 00:58:09,949 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:09" (1/1) ... [2025-01-10 00:58:09,960 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2025-01-10 00:58:09,960 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:09" (1/1) ... [2025-01-10 00:58:09,961 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:09" (1/1) ... [2025-01-10 00:58:09,969 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:09" (1/1) ... [2025-01-10 00:58:09,970 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:09" (1/1) ... [2025-01-10 00:58:09,972 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:09" (1/1) ... [2025-01-10 00:58:09,977 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:09" (1/1) ... [2025-01-10 00:58:09,977 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:09" (1/1) ... [2025-01-10 00:58:09,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:58:09,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:58:09,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:58:09,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:58:09,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:09" (1/1) ... [2025-01-10 00:58:09,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:10,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:58:10,018 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:10,021 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:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:58:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:58:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:58:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:58:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 00:58:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:58:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:58:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:58:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:58:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 00:58:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:58:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:58:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:58:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:58:10,038 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:58:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:58:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:58:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:58:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:58:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:58:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 00:58:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:58:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:58:10,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:58:10,041 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:10,137 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:58:10,138 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:58:10,321 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:58:10,322 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:58:10,456 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:58:10,457 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 00:58:10,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:58:10 BoogieIcfgContainer [2025-01-10 00:58:10,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:58:10,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:58:10,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:58:10,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:58:10,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:58:09" (1/3) ... [2025-01-10 00:58:10,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a515d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:58:10, skipping insertion in model container [2025-01-10 00:58:10,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:09" (2/3) ... [2025-01-10 00:58:10,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a515d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:58:10, skipping insertion in model container [2025-01-10 00:58:10,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:58:10" (3/3) ... [2025-01-10 00:58:10,465 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2025-01-10 00:58:10,475 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:58:10,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_19-callback_racing.i that has 2 procedures, 52 locations, 1 initial locations, 7 loop locations, and 6 error locations. [2025-01-10 00:58:10,478 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:58:10,514 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:58:10,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 65 transitions, 137 flow [2025-01-10 00:58:10,598 INFO L124 PetriNetUnfolderBase]: 21/104 cut-off events. [2025-01-10 00:58:10,600 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:58:10,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 104 events. 21/104 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 384 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2025-01-10 00:58:10,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 65 transitions, 137 flow [2025-01-10 00:58:10,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 65 transitions, 137 flow [2025-01-10 00:58:10,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:10,623 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;@5cc04df9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:10,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:58:10,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:10,629 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:58:10,629 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:10,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:10,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:10,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-01-10 00:58:10,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:10,635 INFO L85 PathProgramCache]: Analyzing trace with hash 403921, now seen corresponding path program 1 times [2025-01-10 00:58:10,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:10,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672873008] [2025-01-10 00:58:10,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:10,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:10,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:10,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:10,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:10,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:10,852 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:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:10,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672873008] [2025-01-10 00:58:10,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672873008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:10,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:10,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719242006] [2025-01-10 00:58:10,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:10,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:10,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:10,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:10,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:10,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2025-01-10 00:58:10,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 65 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:10,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:10,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2025-01-10 00:58:10,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:11,096 INFO L124 PetriNetUnfolderBase]: 173/517 cut-off events. [2025-01-10 00:58:11,097 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:58:11,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 517 events. 173/517 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2770 event pairs, 136 based on Foata normal form. 97/576 useless extension candidates. Maximal degree in co-relation 828. Up to 337 conditions per place. [2025-01-10 00:58:11,103 INFO L140 encePairwiseOnDemand]: 51/65 looper letters, 39 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-01-10 00:58:11,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 209 flow [2025-01-10 00:58:11,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-01-10 00:58:11,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846153846153846 [2025-01-10 00:58:11,119 INFO L175 Difference]: Start difference. First operand has 55 places, 65 transitions, 137 flow. Second operand 3 states and 114 transitions. [2025-01-10 00:58:11,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 209 flow [2025-01-10 00:58:11,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:11,126 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 115 flow [2025-01-10 00:58:11,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2025-01-10 00:58:11,131 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2025-01-10 00:58:11,133 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 115 flow [2025-01-10 00:58:11,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:11,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:11,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:11,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:58:11,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-01-10 00:58:11,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash 403922, now seen corresponding path program 1 times [2025-01-10 00:58:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:11,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005052549] [2025-01-10 00:58:11,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:11,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:11,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:11,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:11,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:11,282 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:11,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:11,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005052549] [2025-01-10 00:58:11,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005052549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:11,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:11,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:11,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483079040] [2025-01-10 00:58:11,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:11,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:11,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:11,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:11,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:11,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 65 [2025-01-10 00:58:11,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:11,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:11,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 65 [2025-01-10 00:58:11,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:11,449 INFO L124 PetriNetUnfolderBase]: 162/477 cut-off events. [2025-01-10 00:58:11,450 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 00:58:11,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 477 events. 162/477 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2417 event pairs, 136 based on Foata normal form. 1/439 useless extension candidates. Maximal degree in co-relation 805. Up to 329 conditions per place. [2025-01-10 00:58:11,454 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 39 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2025-01-10 00:58:11,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 215 flow [2025-01-10 00:58:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-01-10 00:58:11,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2025-01-10 00:58:11,456 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 115 flow. Second operand 3 states and 109 transitions. [2025-01-10 00:58:11,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 215 flow [2025-01-10 00:58:11,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:11,458 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 121 flow [2025-01-10 00:58:11,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-01-10 00:58:11,459 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2025-01-10 00:58:11,459 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 121 flow [2025-01-10 00:58:11,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:11,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:11,459 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:11,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:58:11,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-01-10 00:58:11,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash -620290330, now seen corresponding path program 1 times [2025-01-10 00:58:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:11,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200917892] [2025-01-10 00:58:11,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:11,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:11,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:11,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:11,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:11,621 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:11,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:11,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200917892] [2025-01-10 00:58:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200917892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:11,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971506122] [2025-01-10 00:58:11,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:11,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:58:11,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:11,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:58:11,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:58:11,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 65 [2025-01-10 00:58:11,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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:11,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:11,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 65 [2025-01-10 00:58:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:11,714 INFO L124 PetriNetUnfolderBase]: 24/87 cut-off events. [2025-01-10 00:58:11,714 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-10 00:58:11,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 87 events. 24/87 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 242 event pairs, 14 based on Foata normal form. 18/105 useless extension candidates. Maximal degree in co-relation 158. Up to 51 conditions per place. [2025-01-10 00:58:11,715 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 21 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-01-10 00:58:11,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 118 flow [2025-01-10 00:58:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:58:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:58:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-01-10 00:58:11,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41923076923076924 [2025-01-10 00:58:11,716 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 121 flow. Second operand 4 states and 109 transitions. [2025-01-10 00:58:11,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 118 flow [2025-01-10 00:58:11,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:58:11,718 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 50 flow [2025-01-10 00:58:11,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=50, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2025-01-10 00:58:11,719 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -28 predicate places. [2025-01-10 00:58:11,719 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 50 flow [2025-01-10 00:58:11,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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:11,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:11,720 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 00:58:11,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:58:11,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-01-10 00:58:11,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:11,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2049130676, now seen corresponding path program 1 times [2025-01-10 00:58:11,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:11,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469971009] [2025-01-10 00:58:11,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:11,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:11,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:58:11,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:58:11,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:11,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:11,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:58:11,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:58:11,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:58:11,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:11,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:11,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:58:11,774 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:58:11,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-01-10 00:58:11,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-01-10 00:58:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-01-10 00:58:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2025-01-10 00:58:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2025-01-10 00:58:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-01-10 00:58:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-01-10 00:58:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:58:11,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:58:11,780 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:58:11,783 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:58:11,783 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:58:11,801 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:58:11,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 87 transitions, 190 flow [2025-01-10 00:58:11,819 INFO L124 PetriNetUnfolderBase]: 35/177 cut-off events. [2025-01-10 00:58:11,819 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-10 00:58:11,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 177 events. 35/177 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 757 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 108. Up to 9 conditions per place. [2025-01-10 00:58:11,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 87 transitions, 190 flow [2025-01-10 00:58:11,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 87 transitions, 190 flow [2025-01-10 00:58:11,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:11,823 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;@5cc04df9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:11,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-10 00:58:11,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:11,825 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:58:11,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:11,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:11,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:11,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:11,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash 490312, now seen corresponding path program 1 times [2025-01-10 00:58:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748041604] [2025-01-10 00:58:11,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:11,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:11,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:11,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:11,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:11,869 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:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:11,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748041604] [2025-01-10 00:58:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748041604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:11,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959437854] [2025-01-10 00:58:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:11,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:11,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:11,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:11,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 87 [2025-01-10 00:58:11,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 87 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:11,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:11,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 87 [2025-01-10 00:58:11,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:12,399 INFO L124 PetriNetUnfolderBase]: 3201/6416 cut-off events. [2025-01-10 00:58:12,400 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-10 00:58:12,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11544 conditions, 6416 events. 3201/6416 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 49782 event pairs, 2688 based on Foata normal form. 1446/7475 useless extension candidates. Maximal degree in co-relation 8154. Up to 4555 conditions per place. [2025-01-10 00:58:12,441 INFO L140 encePairwiseOnDemand]: 69/87 looper letters, 57 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-01-10 00:58:12,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 304 flow [2025-01-10 00:58:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-01-10 00:58:12,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6168582375478927 [2025-01-10 00:58:12,449 INFO L175 Difference]: Start difference. First operand has 74 places, 87 transitions, 190 flow. Second operand 3 states and 161 transitions. [2025-01-10 00:58:12,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 304 flow [2025-01-10 00:58:12,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 85 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:12,450 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 158 flow [2025-01-10 00:58:12,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=154, 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=158, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2025-01-10 00:58:12,451 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2025-01-10 00:58:12,451 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 158 flow [2025-01-10 00:58:12,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:12,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:12,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:12,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:58:12,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:12,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 490313, now seen corresponding path program 1 times [2025-01-10 00:58:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564603281] [2025-01-10 00:58:12,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:12,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:12,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:12,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:12,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:12,512 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:12,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:12,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564603281] [2025-01-10 00:58:12,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564603281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:12,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:12,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:12,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529411965] [2025-01-10 00:58:12,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:12,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:12,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:12,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:12,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:12,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 87 [2025-01-10 00:58:12,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:12,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:12,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 87 [2025-01-10 00:58:12,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:12,926 INFO L124 PetriNetUnfolderBase]: 3038/6166 cut-off events. [2025-01-10 00:58:12,926 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-01-10 00:58:12,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11120 conditions, 6166 events. 3038/6166 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 47381 event pairs, 2840 based on Foata normal form. 1/5752 useless extension candidates. Maximal degree in co-relation 10169. Up to 4789 conditions per place. [2025-01-10 00:58:12,950 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 50 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-01-10 00:58:12,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 79 transitions, 282 flow [2025-01-10 00:58:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2025-01-10 00:58:12,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2025-01-10 00:58:12,951 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 158 flow. Second operand 3 states and 141 transitions. [2025-01-10 00:58:12,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 79 transitions, 282 flow [2025-01-10 00:58:12,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:12,956 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 168 flow [2025-01-10 00:58:12,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2025-01-10 00:58:12,956 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2025-01-10 00:58:12,957 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 168 flow [2025-01-10 00:58:12,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:12,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:12,957 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:12,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:58:12,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:12,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1857475081, now seen corresponding path program 1 times [2025-01-10 00:58:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499606315] [2025-01-10 00:58:12,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:12,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:12,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:12,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:13,071 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:13,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:13,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499606315] [2025-01-10 00:58:13,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499606315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:13,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:13,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715399939] [2025-01-10 00:58:13,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:13,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:58:13,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:13,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:58:13,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:58:13,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-01-10 00:58:13,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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:13,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:13,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-01-10 00:58:13,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:13,508 INFO L124 PetriNetUnfolderBase]: 2915/5738 cut-off events. [2025-01-10 00:58:13,509 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-01-10 00:58:13,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10543 conditions, 5738 events. 2915/5738 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 43517 event pairs, 348 based on Foata normal form. 99/5566 useless extension candidates. Maximal degree in co-relation 9289. Up to 3679 conditions per place. [2025-01-10 00:58:13,540 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 81 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2025-01-10 00:58:13,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 422 flow [2025-01-10 00:58:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:58:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:58:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2025-01-10 00:58:13,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5241379310344828 [2025-01-10 00:58:13,542 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 168 flow. Second operand 5 states and 228 transitions. [2025-01-10 00:58:13,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 422 flow [2025-01-10 00:58:13,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 112 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:58:13,544 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 179 flow [2025-01-10 00:58:13,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2025-01-10 00:58:13,546 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2025-01-10 00:58:13,547 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 179 flow [2025-01-10 00:58:13,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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:13,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:13,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:13,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:58:13,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:13,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 587922494, now seen corresponding path program 1 times [2025-01-10 00:58:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:13,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955503794] [2025-01-10 00:58:13,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:13,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:13,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:58:13,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:58:13,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:13,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:13,603 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:13,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:13,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955503794] [2025-01-10 00:58:13,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955503794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:13,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:13,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:13,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855275591] [2025-01-10 00:58:13,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:13,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:58:13,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:13,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:58:13,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:58:13,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 87 [2025-01-10 00:58:13,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:13,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:13,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 87 [2025-01-10 00:58:13,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:14,321 INFO L124 PetriNetUnfolderBase]: 4741/9210 cut-off events. [2025-01-10 00:58:14,322 INFO L125 PetriNetUnfolderBase]: For 932/932 co-relation queries the response was YES. [2025-01-10 00:58:14,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17272 conditions, 9210 events. 4741/9210 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 69119 event pairs, 1594 based on Foata normal form. 0/8460 useless extension candidates. Maximal degree in co-relation 13274. Up to 3661 conditions per place. [2025-01-10 00:58:14,361 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 119 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2025-01-10 00:58:14,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 152 transitions, 631 flow [2025-01-10 00:58:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:58:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:58:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 269 transitions. [2025-01-10 00:58:14,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6183908045977011 [2025-01-10 00:58:14,363 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 179 flow. Second operand 5 states and 269 transitions. [2025-01-10 00:58:14,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 152 transitions, 631 flow [2025-01-10 00:58:14,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 152 transitions, 614 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 00:58:14,369 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 219 flow [2025-01-10 00:58:14,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-01-10 00:58:14,369 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2025-01-10 00:58:14,369 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 219 flow [2025-01-10 00:58:14,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:14,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:14,370 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-01-10 00:58:14,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:58:14,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:14,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash -682989131, now seen corresponding path program 1 times [2025-01-10 00:58:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:14,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86253796] [2025-01-10 00:58:14,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:14,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:58:14,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:58:14,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:14,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:14,389 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:58:14,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:58:14,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:58:14,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:14,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:14,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:58:14,410 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:58:14,410 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-10 00:58:14,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-01-10 00:58:14,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-01-10 00:58:14,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-01-10 00:58:14,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-01-10 00:58:14,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-01-10 00:58:14,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-01-10 00:58:14,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-01-10 00:58:14,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-01-10 00:58:14,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:58:14,411 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 00:58:14,412 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:58:14,412 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:58:14,433 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 00:58:14,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 109 transitions, 245 flow [2025-01-10 00:58:14,452 INFO L124 PetriNetUnfolderBase]: 52/271 cut-off events. [2025-01-10 00:58:14,453 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-01-10 00:58:14,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 271 events. 52/271 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1253 event pairs, 1 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 188. Up to 12 conditions per place. [2025-01-10 00:58:14,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 109 transitions, 245 flow [2025-01-10 00:58:14,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 109 transitions, 245 flow [2025-01-10 00:58:14,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:14,457 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;@5cc04df9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:14,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 00:58:14,459 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:14,459 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:58:14,459 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:14,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:14,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:14,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:14,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash 598549, now seen corresponding path program 1 times [2025-01-10 00:58:14,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:14,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587450212] [2025-01-10 00:58:14,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:14,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:14,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:14,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:14,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:14,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:14,488 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:14,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:14,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587450212] [2025-01-10 00:58:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587450212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:14,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:14,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849883208] [2025-01-10 00:58:14,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:14,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:14,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:14,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:14,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 109 [2025-01-10 00:58:14,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 109 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:14,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:14,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 109 [2025-01-10 00:58:14,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:17,940 INFO L124 PetriNetUnfolderBase]: 44624/74164 cut-off events. [2025-01-10 00:58:17,940 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES. [2025-01-10 00:58:18,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136836 conditions, 74164 events. 44624/74164 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 2208. Compared 671186 event pairs, 38073 based on Foata normal form. 18973/89420 useless extension candidates. Maximal degree in co-relation 42401. Up to 55214 conditions per place. [2025-01-10 00:58:18,401 INFO L140 encePairwiseOnDemand]: 87/109 looper letters, 75 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-01-10 00:58:18,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 110 transitions, 401 flow [2025-01-10 00:58:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2025-01-10 00:58:18,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636085626911315 [2025-01-10 00:58:18,403 INFO L175 Difference]: Start difference. First operand has 93 places, 109 transitions, 245 flow. Second operand 3 states and 208 transitions. [2025-01-10 00:58:18,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 110 transitions, 401 flow [2025-01-10 00:58:18,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 110 transitions, 401 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:18,407 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 203 flow [2025-01-10 00:58:18,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2025-01-10 00:58:18,409 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -3 predicate places. [2025-01-10 00:58:18,409 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 203 flow [2025-01-10 00:58:18,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:18,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:18,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:18,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:58:18,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:18,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:18,410 INFO L85 PathProgramCache]: Analyzing trace with hash 598550, now seen corresponding path program 1 times [2025-01-10 00:58:18,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:18,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832669250] [2025-01-10 00:58:18,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:18,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:18,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:18,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:18,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:18,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:18,473 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:18,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:18,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832669250] [2025-01-10 00:58:18,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832669250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:18,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:18,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:18,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869068672] [2025-01-10 00:58:18,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:18,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:18,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:18,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:18,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 109 [2025-01-10 00:58:18,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:18,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:18,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 109 [2025-01-10 00:58:18,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:21,904 INFO L124 PetriNetUnfolderBase]: 42221/71131 cut-off events. [2025-01-10 00:58:21,904 INFO L125 PetriNetUnfolderBase]: For 2055/2065 co-relation queries the response was YES. [2025-01-10 00:58:21,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131389 conditions, 71131 events. 42221/71131 cut-off events. For 2055/2065 co-relation queries the response was YES. Maximal size of possible extension queue 2097. Compared 647459 event pairs, 26281 based on Foata normal form. 1/67439 useless extension candidates. Maximal degree in co-relation 115412. Up to 58588 conditions per place. [2025-01-10 00:58:22,244 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 60 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-01-10 00:58:22,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 347 flow [2025-01-10 00:58:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2025-01-10 00:58:22,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5259938837920489 [2025-01-10 00:58:22,246 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 203 flow. Second operand 3 states and 172 transitions. [2025-01-10 00:58:22,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 347 flow [2025-01-10 00:58:22,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 96 transitions, 343 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:22,293 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 213 flow [2025-01-10 00:58:22,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2025-01-10 00:58:22,293 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -2 predicate places. [2025-01-10 00:58:22,293 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 213 flow [2025-01-10 00:58:22,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:22,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:22,294 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:22,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:58:22,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:22,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1258646270, now seen corresponding path program 1 times [2025-01-10 00:58:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:22,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008096952] [2025-01-10 00:58:22,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:22,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:22,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:22,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:22,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:22,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:22,423 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:22,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008096952] [2025-01-10 00:58:22,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008096952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:22,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:22,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:22,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744321140] [2025-01-10 00:58:22,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:22,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:58:22,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:22,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:58:22,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:58:22,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 109 [2025-01-10 00:58:22,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 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:22,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:22,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 109 [2025-01-10 00:58:22,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:25,842 INFO L124 PetriNetUnfolderBase]: 42098/70256 cut-off events. [2025-01-10 00:58:25,843 INFO L125 PetriNetUnfolderBase]: For 3789/3789 co-relation queries the response was YES. [2025-01-10 00:58:25,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130923 conditions, 70256 events. 42098/70256 cut-off events. For 3789/3789 co-relation queries the response was YES. Maximal size of possible extension queue 2049. Compared 638571 event pairs, 4326 based on Foata normal form. 828/68174 useless extension candidates. Maximal degree in co-relation 116211. Up to 47434 conditions per place. [2025-01-10 00:58:26,171 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 107 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2025-01-10 00:58:26,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 145 transitions, 551 flow [2025-01-10 00:58:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:58:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:58:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-01-10 00:58:26,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5302752293577981 [2025-01-10 00:58:26,173 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 213 flow. Second operand 5 states and 289 transitions. [2025-01-10 00:58:26,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 145 transitions, 551 flow [2025-01-10 00:58:26,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 145 transitions, 549 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:58:26,178 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 224 flow [2025-01-10 00:58:26,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2025-01-10 00:58:26,179 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2025-01-10 00:58:26,179 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 224 flow [2025-01-10 00:58:26,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 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:26,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:26,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:26,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:58:26,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash -811928046, now seen corresponding path program 1 times [2025-01-10 00:58:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:26,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167657920] [2025-01-10 00:58:26,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:26,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:26,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:58:26,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:58:26,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:26,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:26,392 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:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167657920] [2025-01-10 00:58:26,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167657920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:26,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:26,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767691224] [2025-01-10 00:58:26,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:26,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:58:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:26,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:58:26,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:58:26,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 109 [2025-01-10 00:58:26,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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:26,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:26,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 109 [2025-01-10 00:58:26,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:32,210 INFO L124 PetriNetUnfolderBase]: 68744/113371 cut-off events. [2025-01-10 00:58:32,210 INFO L125 PetriNetUnfolderBase]: For 10132/10132 co-relation queries the response was YES. [2025-01-10 00:58:32,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215195 conditions, 113371 events. 68744/113371 cut-off events. For 10132/10132 co-relation queries the response was YES. Maximal size of possible extension queue 2168. Compared 1024018 event pairs, 22552 based on Foata normal form. 0/106004 useless extension candidates. Maximal degree in co-relation 61467. Up to 47254 conditions per place. [2025-01-10 00:58:32,769 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 157 selfloop transitions, 7 changer transitions 0/197 dead transitions. [2025-01-10 00:58:32,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 197 transitions, 824 flow [2025-01-10 00:58:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:58:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:58:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2025-01-10 00:58:32,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6275229357798165 [2025-01-10 00:58:32,770 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 224 flow. Second operand 5 states and 342 transitions. [2025-01-10 00:58:32,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 197 transitions, 824 flow [2025-01-10 00:58:32,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 197 transitions, 807 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 00:58:32,778 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 264 flow [2025-01-10 00:58:32,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2025-01-10 00:58:32,778 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 6 predicate places. [2025-01-10 00:58:32,779 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 264 flow [2025-01-10 00:58:32,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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:32,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:32,779 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:32,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:58:32,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:32,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:32,779 INFO L85 PathProgramCache]: Analyzing trace with hash 691087727, now seen corresponding path program 1 times [2025-01-10 00:58:32,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:32,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18161459] [2025-01-10 00:58:32,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:32,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:32,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:58:32,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:58:32,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:32,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:32,818 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:32,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:32,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18161459] [2025-01-10 00:58:32,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18161459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:32,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:32,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823953141] [2025-01-10 00:58:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:32,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:32,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:32,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:32,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 109 [2025-01-10 00:58:32,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:32,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:32,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 109 [2025-01-10 00:58:32,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:40,828 INFO L124 PetriNetUnfolderBase]: 89926/148920 cut-off events. [2025-01-10 00:58:40,828 INFO L125 PetriNetUnfolderBase]: For 38543/40676 co-relation queries the response was YES. [2025-01-10 00:58:41,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303798 conditions, 148920 events. 89926/148920 cut-off events. For 38543/40676 co-relation queries the response was YES. Maximal size of possible extension queue 3415. Compared 1427930 event pairs, 55844 based on Foata normal form. 0/141783 useless extension candidates. Maximal degree in co-relation 250600. Up to 86569 conditions per place. [2025-01-10 00:58:41,875 INFO L140 encePairwiseOnDemand]: 106/109 looper letters, 95 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2025-01-10 00:58:41,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 132 transitions, 564 flow [2025-01-10 00:58:41,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2025-01-10 00:58:41,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6116207951070336 [2025-01-10 00:58:41,877 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 264 flow. Second operand 3 states and 200 transitions. [2025-01-10 00:58:41,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 132 transitions, 564 flow [2025-01-10 00:58:41,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 132 transitions, 564 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:41,910 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 276 flow [2025-01-10 00:58:41,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2025-01-10 00:58:41,911 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 9 predicate places. [2025-01-10 00:58:41,911 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 276 flow [2025-01-10 00:58:41,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:41,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:41,911 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2025-01-10 00:58:41,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:58:41,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:41,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2049359161, now seen corresponding path program 1 times [2025-01-10 00:58:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:41,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999060229] [2025-01-10 00:58:41,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:41,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:41,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:58:41,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:58:41,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:41,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:41,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:58:41,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:58:41,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:58:41,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:41,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:41,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:58:41,948 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:58:41,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 00:58:41,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-01-10 00:58:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-01-10 00:58:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2025-01-10 00:58:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-01-10 00:58:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (4 of 10 remaining) [2025-01-10 00:58:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-01-10 00:58:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2025-01-10 00:58:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 10 remaining) [2025-01-10 00:58:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-01-10 00:58:41,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:58:41,949 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-10 00:58:41,951 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:58:41,951 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 00:58:42,073 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 00:58:42,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 131 transitions, 302 flow [2025-01-10 00:58:42,097 INFO L124 PetriNetUnfolderBase]: 77/409 cut-off events. [2025-01-10 00:58:42,098 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2025-01-10 00:58:42,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 409 events. 77/409 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2091 event pairs, 6 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 295. Up to 32 conditions per place. [2025-01-10 00:58:42,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 131 transitions, 302 flow [2025-01-10 00:58:42,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 131 transitions, 302 flow [2025-01-10 00:58:42,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:42,105 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;@5cc04df9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:42,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-10 00:58:42,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:42,106 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:58:42,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:42,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:42,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:42,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-10 00:58:42,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:42,107 INFO L85 PathProgramCache]: Analyzing trace with hash 728632, now seen corresponding path program 1 times [2025-01-10 00:58:42,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:42,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130484678] [2025-01-10 00:58:42,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:42,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:42,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:42,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:42,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:42,131 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:42,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:42,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130484678] [2025-01-10 00:58:42,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130484678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:42,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:42,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:42,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412583317] [2025-01-10 00:58:42,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:42,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:42,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:42,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:42,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:42,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 131 [2025-01-10 00:58:42,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 131 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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:42,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:42,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 131 [2025-01-10 00:58:42,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand