./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/reorder_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/reorder_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:55:19,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:55:19,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:55:19,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:55:19,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:55:19,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:55:19,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:55:19,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:55:19,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:55:19,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:55:19,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:55:19,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:55:19,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:55:19,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:55:19,521 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:55:19,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:55:19,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:55:19,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:55:19,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:55:19,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:55:19,522 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:55:19,522 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:55:19,522 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:55:19,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:55:19,523 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:55:19,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:55:19,523 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:55:19,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:55:19,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:55:19,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:55:19,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:55:19,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:55:19,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:55:19,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:19,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:55:19,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:55:19,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:55:19,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:55:19,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:55:19,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:55:19,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:55:19,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:55:19,525 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 [2025-03-09 00:55:19,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:55:19,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:55:19,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:55:19,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:55:19,796 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:55:19,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_2.i [2025-03-09 00:55:20,956 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e70bc47/1600b6bb26c347e2a38a19ee6bc9e9e2/FLAG7dc222db9 [2025-03-09 00:55:21,253 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:55:21,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/reorder_2.i [2025-03-09 00:55:21,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e70bc47/1600b6bb26c347e2a38a19ee6bc9e9e2/FLAG7dc222db9 [2025-03-09 00:55:21,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e70bc47/1600b6bb26c347e2a38a19ee6bc9e9e2 [2025-03-09 00:55:21,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:55:21,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:55:21,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:21,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:55:21,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:55:21,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2427776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21, skipping insertion in model container [2025-03-09 00:55:21,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:55:21,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:21,662 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:55:21,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:21,756 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:55:21,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21 WrapperNode [2025-03-09 00:55:21,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:21,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:21,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:55:21,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:55:21,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,789 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2025-03-09 00:55:21,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:21,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:55:21,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:55:21,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:55:21,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,812 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-09 00:55:21,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:55:21,823 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:55:21,823 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:55:21,823 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:55:21,824 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (1/1) ... [2025-03-09 00:55:21,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:21,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:21,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:55:21,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:55:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:55:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:55:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:55:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:55:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:55:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-09 00:55:21,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-09 00:55:21,874 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:55:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:55:21,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:55:21,875 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:55:21,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:55:21,993 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:55:22,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-03-09 00:55:22,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-03-09 00:55:22,218 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-03-09 00:55:22,218 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-03-09 00:55:22,219 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:55:22,220 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:55:22,344 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:55:22,344 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:55:22,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:22 BoogieIcfgContainer [2025-03-09 00:55:22,345 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:55:22,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:55:22,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:55:22,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:55:22,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:55:21" (1/3) ... [2025-03-09 00:55:22,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21983e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:22, skipping insertion in model container [2025-03-09 00:55:22,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:21" (2/3) ... [2025-03-09 00:55:22,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21983e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:22, skipping insertion in model container [2025-03-09 00:55:22,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:22" (3/3) ... [2025-03-09 00:55:22,356 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2025-03-09 00:55:22,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:55:22,369 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_2.i that has 3 procedures, 50 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-09 00:55:22,369 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:55:22,408 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 00:55:22,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 59 transitions, 138 flow [2025-03-09 00:55:22,483 INFO L124 PetriNetUnfolderBase]: 14/137 cut-off events. [2025-03-09 00:55:22,487 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 00:55:22,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 137 events. 14/137 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 674 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 69. Up to 7 conditions per place. [2025-03-09 00:55:22,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 59 transitions, 138 flow [2025-03-09 00:55:22,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 59 transitions, 138 flow [2025-03-09 00:55:22,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:55:22,511 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;@3f744340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:55:22,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-09 00:55:22,516 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:55:22,517 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-09 00:55:22,517 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:55:22,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:22,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 00:55:22,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:22,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash 10433510, now seen corresponding path program 1 times [2025-03-09 00:55:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:22,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237158009] [2025-03-09 00:55:22,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:22,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:55:22,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:55:22,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:22,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:22,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:22,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237158009] [2025-03-09 00:55:22,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237158009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:22,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:22,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:55:22,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19933183] [2025-03-09 00:55:22,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:22,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:55:22,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:22,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:55:22,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:55:22,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-09 00:55:22,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 138 flow. Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:22,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:22,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-09 00:55:22,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:22,836 INFO L124 PetriNetUnfolderBase]: 286/757 cut-off events. [2025-03-09 00:55:22,836 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-09 00:55:22,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 757 events. 286/757 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4663 event pairs, 263 based on Foata normal form. 75/729 useless extension candidates. Maximal degree in co-relation 1022. Up to 528 conditions per place. [2025-03-09 00:55:22,844 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 28 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2025-03-09 00:55:22,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 182 flow [2025-03-09 00:55:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:55:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:55:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2025-03-09 00:55:22,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7033898305084746 [2025-03-09 00:55:22,856 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 138 flow. Second operand 2 states and 83 transitions. [2025-03-09 00:55:22,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 182 flow [2025-03-09 00:55:22,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:22,865 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 126 flow [2025-03-09 00:55:22,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=126, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-03-09 00:55:22,870 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-03-09 00:55:22,871 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 126 flow [2025-03-09 00:55:22,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:22,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:22,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:22,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:55:22,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:22,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash 323463578, now seen corresponding path program 1 times [2025-03-09 00:55:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:22,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994006537] [2025-03-09 00:55:22,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:22,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:22,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:22,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:22,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:23,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:23,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994006537] [2025-03-09 00:55:23,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994006537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:23,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:23,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:23,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948256431] [2025-03-09 00:55:23,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:23,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:23,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:23,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:23,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-09 00:55:23,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:23,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:23,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-09 00:55:23,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:23,545 INFO L124 PetriNetUnfolderBase]: 638/1720 cut-off events. [2025-03-09 00:55:23,545 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-09 00:55:23,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 1720 events. 638/1720 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13289 event pairs, 444 based on Foata normal form. 1/1524 useless extension candidates. Maximal degree in co-relation 2957. Up to 603 conditions per place. [2025-03-09 00:55:23,552 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 57 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2025-03-09 00:55:23,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 328 flow [2025-03-09 00:55:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2025-03-09 00:55:23,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6567796610169492 [2025-03-09 00:55:23,554 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 126 flow. Second operand 4 states and 155 transitions. [2025-03-09 00:55:23,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 328 flow [2025-03-09 00:55:23,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 84 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:23,558 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 152 flow [2025-03-09 00:55:23,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2025-03-09 00:55:23,561 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2025-03-09 00:55:23,562 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 152 flow [2025-03-09 00:55:23,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:23,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:23,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:23,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:55:23,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:23,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:23,564 INFO L85 PathProgramCache]: Analyzing trace with hash 323463577, now seen corresponding path program 1 times [2025-03-09 00:55:23,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:23,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595372449] [2025-03-09 00:55:23,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:23,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:23,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:23,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:23,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:23,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595372449] [2025-03-09 00:55:23,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595372449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:23,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:23,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:23,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087593232] [2025-03-09 00:55:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:23,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:23,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:23,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:23,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2025-03-09 00:55:23,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:23,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:23,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2025-03-09 00:55:23,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:23,811 INFO L124 PetriNetUnfolderBase]: 638/1692 cut-off events. [2025-03-09 00:55:23,811 INFO L125 PetriNetUnfolderBase]: For 111/114 co-relation queries the response was YES. [2025-03-09 00:55:23,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 1692 events. 638/1692 cut-off events. For 111/114 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13155 event pairs, 448 based on Foata normal form. 0/1525 useless extension candidates. Maximal degree in co-relation 2963. Up to 897 conditions per place. [2025-03-09 00:55:23,820 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 36 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-03-09 00:55:23,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 240 flow [2025-03-09 00:55:23,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-09 00:55:23,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2025-03-09 00:55:23,822 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 152 flow. Second operand 3 states and 102 transitions. [2025-03-09 00:55:23,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 240 flow [2025-03-09 00:55:23,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:23,823 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 152 flow [2025-03-09 00:55:23,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-09 00:55:23,824 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2025-03-09 00:55:23,824 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 152 flow [2025-03-09 00:55:23,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:23,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:23,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:23,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:55:23,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:23,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1963112310, now seen corresponding path program 1 times [2025-03-09 00:55:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:23,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928372088] [2025-03-09 00:55:23,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:23,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:23,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:23,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:23,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:23,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:23,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928372088] [2025-03-09 00:55:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928372088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:23,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673928419] [2025-03-09 00:55:23,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:23,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:23,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:23,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:23,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:24,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2025-03-09 00:55:24,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:24,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:24,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2025-03-09 00:55:24,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:24,254 INFO L124 PetriNetUnfolderBase]: 796/2028 cut-off events. [2025-03-09 00:55:24,254 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-03-09 00:55:24,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3661 conditions, 2028 events. 796/2028 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15733 event pairs, 332 based on Foata normal form. 1/1717 useless extension candidates. Maximal degree in co-relation 3653. Up to 1438 conditions per place. [2025-03-09 00:55:24,264 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 44 selfloop transitions, 7 changer transitions 2/71 dead transitions. [2025-03-09 00:55:24,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 301 flow [2025-03-09 00:55:24,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-03-09 00:55:24,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5635593220338984 [2025-03-09 00:55:24,265 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 152 flow. Second operand 4 states and 133 transitions. [2025-03-09 00:55:24,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 301 flow [2025-03-09 00:55:24,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:24,268 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 186 flow [2025-03-09 00:55:24,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-03-09 00:55:24,269 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2025-03-09 00:55:24,269 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 186 flow [2025-03-09 00:55:24,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:24,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:24,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:24,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:55:24,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:24,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:24,270 INFO L85 PathProgramCache]: Analyzing trace with hash 726937844, now seen corresponding path program 1 times [2025-03-09 00:55:24,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:24,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644515244] [2025-03-09 00:55:24,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:24,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:24,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:24,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:24,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:24,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:24,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644515244] [2025-03-09 00:55:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644515244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:24,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:24,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363270563] [2025-03-09 00:55:24,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:24,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:24,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:24,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:24,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2025-03-09 00:55:24,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:24,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:24,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2025-03-09 00:55:24,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:24,503 INFO L124 PetriNetUnfolderBase]: 704/1763 cut-off events. [2025-03-09 00:55:24,504 INFO L125 PetriNetUnfolderBase]: For 211/214 co-relation queries the response was YES. [2025-03-09 00:55:24,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 1763 events. 704/1763 cut-off events. For 211/214 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13357 event pairs, 514 based on Foata normal form. 0/1701 useless extension candidates. Maximal degree in co-relation 3352. Up to 1009 conditions per place. [2025-03-09 00:55:24,537 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 38 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-03-09 00:55:24,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 280 flow [2025-03-09 00:55:24,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-09 00:55:24,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2025-03-09 00:55:24,539 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 186 flow. Second operand 3 states and 102 transitions. [2025-03-09 00:55:24,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 280 flow [2025-03-09 00:55:24,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 61 transitions, 269 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:24,541 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 179 flow [2025-03-09 00:55:24,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-03-09 00:55:24,542 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2025-03-09 00:55:24,542 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 179 flow [2025-03-09 00:55:24,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:24,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:24,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:24,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:55:24,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:24,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:24,543 INFO L85 PathProgramCache]: Analyzing trace with hash 726937845, now seen corresponding path program 1 times [2025-03-09 00:55:24,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:24,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941853521] [2025-03-09 00:55:24,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:24,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:24,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:24,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:24,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:24,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:24,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:24,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941853521] [2025-03-09 00:55:24,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941853521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:24,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:24,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:24,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402248932] [2025-03-09 00:55:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:24,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:24,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:24,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:24,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:24,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2025-03-09 00:55:24,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:24,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:24,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2025-03-09 00:55:24,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:24,914 INFO L124 PetriNetUnfolderBase]: 919/2100 cut-off events. [2025-03-09 00:55:24,914 INFO L125 PetriNetUnfolderBase]: For 303/321 co-relation queries the response was YES. [2025-03-09 00:55:24,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4212 conditions, 2100 events. 919/2100 cut-off events. For 303/321 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 15427 event pairs, 172 based on Foata normal form. 0/1922 useless extension candidates. Maximal degree in co-relation 4202. Up to 654 conditions per place. [2025-03-09 00:55:24,923 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 57 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2025-03-09 00:55:24,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 89 transitions, 413 flow [2025-03-09 00:55:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2025-03-09 00:55:24,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5796610169491525 [2025-03-09 00:55:24,925 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 179 flow. Second operand 5 states and 171 transitions. [2025-03-09 00:55:24,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 89 transitions, 413 flow [2025-03-09 00:55:24,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 89 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:24,930 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 268 flow [2025-03-09 00:55:24,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-03-09 00:55:24,930 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 8 predicate places. [2025-03-09 00:55:24,930 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 268 flow [2025-03-09 00:55:24,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:24,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:24,931 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:24,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:55:24,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:24,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1850108939, now seen corresponding path program 1 times [2025-03-09 00:55:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:24,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367766247] [2025-03-09 00:55:24,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:24,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:24,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:24,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:24,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:24,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:25,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367766247] [2025-03-09 00:55:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367766247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:25,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:25,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:25,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774197126] [2025-03-09 00:55:25,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:25,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:55:25,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:25,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:55:25,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:55:25,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-09 00:55:25,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:25,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:25,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-09 00:55:25,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:25,391 INFO L124 PetriNetUnfolderBase]: 357/983 cut-off events. [2025-03-09 00:55:25,391 INFO L125 PetriNetUnfolderBase]: For 437/439 co-relation queries the response was YES. [2025-03-09 00:55:25,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 983 events. 357/983 cut-off events. For 437/439 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6534 event pairs, 327 based on Foata normal form. 8/987 useless extension candidates. Maximal degree in co-relation 2287. Up to 659 conditions per place. [2025-03-09 00:55:25,395 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 47 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2025-03-09 00:55:25,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 396 flow [2025-03-09 00:55:25,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2025-03-09 00:55:25,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535593220338983 [2025-03-09 00:55:25,397 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 268 flow. Second operand 5 states and 158 transitions. [2025-03-09 00:55:25,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 396 flow [2025-03-09 00:55:25,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:25,399 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 276 flow [2025-03-09 00:55:25,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2025-03-09 00:55:25,401 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2025-03-09 00:55:25,401 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 276 flow [2025-03-09 00:55:25,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:25,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:25,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:25,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:55:25,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:25,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1518802535, now seen corresponding path program 1 times [2025-03-09 00:55:25,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:25,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56485034] [2025-03-09 00:55:25,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:25,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:55:25,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:55:25,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:25,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:25,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:55:25,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:55:25,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:55:25,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:25,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:25,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:55:25,436 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:55:25,437 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-09 00:55:25,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-09 00:55:25,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX (12 of 15 remaining) [2025-03-09 00:55:25,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (11 of 15 remaining) [2025-03-09 00:55:25,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-09 00:55:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-09 00:55:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-03-09 00:55:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-09 00:55:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-09 00:55:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-03-09 00:55:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-09 00:55:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-09 00:55:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-09 00:55:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2025-03-09 00:55:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2025-03-09 00:55:25,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:55:25,443 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:25,445 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:55:25,445 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 00:55:25,461 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-09 00:55:25,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 80 transitions, 204 flow [2025-03-09 00:55:25,482 INFO L124 PetriNetUnfolderBase]: 71/450 cut-off events. [2025-03-09 00:55:25,482 INFO L125 PetriNetUnfolderBase]: For 72/78 co-relation queries the response was YES. [2025-03-09 00:55:25,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 450 events. 71/450 cut-off events. For 72/78 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2758 event pairs, 1 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 276. Up to 32 conditions per place. [2025-03-09 00:55:25,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 80 transitions, 204 flow [2025-03-09 00:55:25,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 80 transitions, 204 flow [2025-03-09 00:55:25,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:55:25,486 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;@3f744340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:55:25,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 00:55:25,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:55:25,487 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-09 00:55:25,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:55:25,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:25,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 00:55:25,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:25,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash 12834662, now seen corresponding path program 1 times [2025-03-09 00:55:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:25,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535023271] [2025-03-09 00:55:25,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:25,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:25,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:55:25,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:55:25,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:25,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535023271] [2025-03-09 00:55:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535023271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:55:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161325758] [2025-03-09 00:55:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:25,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:55:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:25,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:55:25,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:55:25,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 80 [2025-03-09 00:55:25,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 204 flow. Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:25,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:25,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 80 [2025-03-09 00:55:25,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:26,950 INFO L124 PetriNetUnfolderBase]: 17090/29578 cut-off events. [2025-03-09 00:55:26,950 INFO L125 PetriNetUnfolderBase]: For 3309/3309 co-relation queries the response was YES. [2025-03-09 00:55:26,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54961 conditions, 29578 events. 17090/29578 cut-off events. For 3309/3309 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 250345 event pairs, 16038 based on Foata normal form. 4347/31703 useless extension candidates. Maximal degree in co-relation 33473. Up to 23687 conditions per place. [2025-03-09 00:55:27,100 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 41 selfloop transitions, 0 changer transitions 0/71 dead transitions. [2025-03-09 00:55:27,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 268 flow [2025-03-09 00:55:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:55:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:55:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 108 transitions. [2025-03-09 00:55:27,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-03-09 00:55:27,102 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 204 flow. Second operand 2 states and 108 transitions. [2025-03-09 00:55:27,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 268 flow [2025-03-09 00:55:27,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:27,114 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 186 flow [2025-03-09 00:55:27,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=186, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2025-03-09 00:55:27,115 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-03-09 00:55:27,115 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 186 flow [2025-03-09 00:55:27,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:27,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:27,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:27,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:55:27,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:27,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash 397899367, now seen corresponding path program 1 times [2025-03-09 00:55:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:27,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796618604] [2025-03-09 00:55:27,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:27,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:27,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:27,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:27,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:27,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:27,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:27,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796618604] [2025-03-09 00:55:27,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796618604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:27,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:27,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:27,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473680234] [2025-03-09 00:55:27,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:27,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:27,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:27,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:27,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:27,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 80 [2025-03-09 00:55:27,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:27,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:27,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 80 [2025-03-09 00:55:27,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:28,533 INFO L124 PetriNetUnfolderBase]: 19397/32434 cut-off events. [2025-03-09 00:55:28,533 INFO L125 PetriNetUnfolderBase]: For 3073/3104 co-relation queries the response was YES. [2025-03-09 00:55:28,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61046 conditions, 32434 events. 19397/32434 cut-off events. For 3073/3104 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 270663 event pairs, 13785 based on Foata normal form. 0/30789 useless extension candidates. Maximal degree in co-relation 61039. Up to 20551 conditions per place. [2025-03-09 00:55:28,700 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 55 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-03-09 00:55:28,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 324 flow [2025-03-09 00:55:28,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-09 00:55:28,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5708333333333333 [2025-03-09 00:55:28,701 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 186 flow. Second operand 3 states and 137 transitions. [2025-03-09 00:55:28,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 324 flow [2025-03-09 00:55:28,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 83 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:28,707 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 186 flow [2025-03-09 00:55:28,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=182, 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=186, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2025-03-09 00:55:28,707 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-03-09 00:55:28,707 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 186 flow [2025-03-09 00:55:28,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:28,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:28,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:28,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:55:28,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:28,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash 397899368, now seen corresponding path program 1 times [2025-03-09 00:55:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:28,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549651206] [2025-03-09 00:55:28,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:28,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:28,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:28,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:28,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:28,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549651206] [2025-03-09 00:55:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549651206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:28,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:28,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:28,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316268363] [2025-03-09 00:55:28,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:28,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:28,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:28,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:28,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:28,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 80 [2025-03-09 00:55:28,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:28,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:28,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 80 [2025-03-09 00:55:28,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:32,009 INFO L124 PetriNetUnfolderBase]: 38653/66455 cut-off events. [2025-03-09 00:55:32,009 INFO L125 PetriNetUnfolderBase]: For 8131/8131 co-relation queries the response was YES. [2025-03-09 00:55:32,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125223 conditions, 66455 events. 38653/66455 cut-off events. For 8131/8131 co-relation queries the response was YES. Maximal size of possible extension queue 2602. Compared 625293 event pairs, 31970 based on Foata normal form. 1/63587 useless extension candidates. Maximal degree in co-relation 125215. Up to 26914 conditions per place. [2025-03-09 00:55:32,343 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 84 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-03-09 00:55:32,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 114 transitions, 496 flow [2025-03-09 00:55:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2025-03-09 00:55:32,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63125 [2025-03-09 00:55:32,346 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 186 flow. Second operand 4 states and 202 transitions. [2025-03-09 00:55:32,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 114 transitions, 496 flow [2025-03-09 00:55:32,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:32,443 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 208 flow [2025-03-09 00:55:32,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=182, 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=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-03-09 00:55:32,444 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2025-03-09 00:55:32,444 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 208 flow [2025-03-09 00:55:32,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:32,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:32,444 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:32,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:55:32,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:32,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1018282378, now seen corresponding path program 1 times [2025-03-09 00:55:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:32,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505171124] [2025-03-09 00:55:32,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:32,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:32,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:32,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:32,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:32,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505171124] [2025-03-09 00:55:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505171124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:32,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619608081] [2025-03-09 00:55:32,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:32,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:32,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:32,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:32,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 80 [2025-03-09 00:55:32,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:32,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:32,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 80 [2025-03-09 00:55:32,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:36,183 INFO L124 PetriNetUnfolderBase]: 47827/81000 cut-off events. [2025-03-09 00:55:36,184 INFO L125 PetriNetUnfolderBase]: For 6473/6473 co-relation queries the response was YES. [2025-03-09 00:55:36,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150918 conditions, 81000 events. 47827/81000 cut-off events. For 6473/6473 co-relation queries the response was YES. Maximal size of possible extension queue 3067. Compared 764136 event pairs, 34378 based on Foata normal form. 1/74194 useless extension candidates. Maximal degree in co-relation 150908. Up to 66388 conditions per place. [2025-03-09 00:55:36,619 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 58 selfloop transitions, 7 changer transitions 2/90 dead transitions. [2025-03-09 00:55:36,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 387 flow [2025-03-09 00:55:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2025-03-09 00:55:36,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.521875 [2025-03-09 00:55:36,620 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 208 flow. Second operand 4 states and 167 transitions. [2025-03-09 00:55:36,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 387 flow [2025-03-09 00:55:36,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 90 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:36,627 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 252 flow [2025-03-09 00:55:36,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-03-09 00:55:36,628 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-03-09 00:55:36,628 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 252 flow [2025-03-09 00:55:36,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:36,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:36,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:36,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:55:36,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:36,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1501984190, now seen corresponding path program 1 times [2025-03-09 00:55:36,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:36,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014452485] [2025-03-09 00:55:36,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:36,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:36,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:36,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:36,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:36,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:36,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014452485] [2025-03-09 00:55:36,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014452485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:36,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:36,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:36,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858669413] [2025-03-09 00:55:36,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:36,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:36,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:36,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:36,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:36,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 80 [2025-03-09 00:55:36,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:36,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:36,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 80 [2025-03-09 00:55:36,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:40,216 INFO L124 PetriNetUnfolderBase]: 42077/71514 cut-off events. [2025-03-09 00:55:40,216 INFO L125 PetriNetUnfolderBase]: For 8853/8968 co-relation queries the response was YES. [2025-03-09 00:55:40,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137944 conditions, 71514 events. 42077/71514 cut-off events. For 8853/8968 co-relation queries the response was YES. Maximal size of possible extension queue 2752. Compared 674841 event pairs, 30936 based on Foata normal form. 0/69657 useless extension candidates. Maximal degree in co-relation 137932. Up to 45526 conditions per place. [2025-03-09 00:55:40,638 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 59 selfloop transitions, 4 changer transitions 0/87 dead transitions. [2025-03-09 00:55:40,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 87 transitions, 402 flow [2025-03-09 00:55:40,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-09 00:55:40,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5708333333333333 [2025-03-09 00:55:40,799 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 252 flow. Second operand 3 states and 137 transitions. [2025-03-09 00:55:40,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 87 transitions, 402 flow [2025-03-09 00:55:40,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 87 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:40,817 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 248 flow [2025-03-09 00:55:40,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2025-03-09 00:55:40,818 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-03-09 00:55:40,818 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 248 flow [2025-03-09 00:55:40,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:40,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:40,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:40,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:55:40,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:40,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:40,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1501984189, now seen corresponding path program 1 times [2025-03-09 00:55:40,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:40,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736162683] [2025-03-09 00:55:40,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:40,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:40,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:40,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:40,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:40,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:40,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736162683] [2025-03-09 00:55:40,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736162683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:40,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:40,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:40,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530769490] [2025-03-09 00:55:40,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:40,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:40,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:40,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:40,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:40,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 80 [2025-03-09 00:55:40,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:40,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:40,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 80 [2025-03-09 00:55:40,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:45,581 INFO L124 PetriNetUnfolderBase]: 61010/97678 cut-off events. [2025-03-09 00:55:45,581 INFO L125 PetriNetUnfolderBase]: For 14549/15014 co-relation queries the response was YES. [2025-03-09 00:55:46,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195573 conditions, 97678 events. 61010/97678 cut-off events. For 14549/15014 co-relation queries the response was YES. Maximal size of possible extension queue 3354. Compared 887213 event pairs, 17892 based on Foata normal form. 0/92446 useless extension candidates. Maximal degree in co-relation 195561. Up to 39978 conditions per place. [2025-03-09 00:55:46,297 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 97 selfloop transitions, 16 changer transitions 0/134 dead transitions. [2025-03-09 00:55:46,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 134 transitions, 628 flow [2025-03-09 00:55:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2025-03-09 00:55:46,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-03-09 00:55:46,299 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 248 flow. Second operand 5 states and 236 transitions. [2025-03-09 00:55:46,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 134 transitions, 628 flow [2025-03-09 00:55:46,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 134 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:46,706 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 343 flow [2025-03-09 00:55:46,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2025-03-09 00:55:46,707 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 8 predicate places. [2025-03-09 00:55:46,707 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 343 flow [2025-03-09 00:55:46,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:46,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:46,708 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:46,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:55:46,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:46,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash -378366230, now seen corresponding path program 1 times [2025-03-09 00:55:46,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:46,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830943318] [2025-03-09 00:55:46,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:46,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:46,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:46,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:46,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:46,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830943318] [2025-03-09 00:55:46,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830943318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:46,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:46,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:46,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563526357] [2025-03-09 00:55:46,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:46,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:55:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:46,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:55:46,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:55:46,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 80 [2025-03-09 00:55:46,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:46,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:46,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 80 [2025-03-09 00:55:46,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:51,251 INFO L124 PetriNetUnfolderBase]: 42837/75278 cut-off events. [2025-03-09 00:55:51,251 INFO L125 PetriNetUnfolderBase]: For 26075/26077 co-relation queries the response was YES. [2025-03-09 00:55:51,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166149 conditions, 75278 events. 42837/75278 cut-off events. For 26075/26077 co-relation queries the response was YES. Maximal size of possible extension queue 2833. Compared 740172 event pairs, 31030 based on Foata normal form. 8/74964 useless extension candidates. Maximal degree in co-relation 166134. Up to 31080 conditions per place. [2025-03-09 00:55:51,711 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 109 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-03-09 00:55:51,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 139 transitions, 797 flow [2025-03-09 00:55:51,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2025-03-09 00:55:51,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925 [2025-03-09 00:55:51,712 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 343 flow. Second operand 5 states and 237 transitions. [2025-03-09 00:55:51,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 139 transitions, 797 flow [2025-03-09 00:55:51,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 139 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:51,731 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 362 flow [2025-03-09 00:55:51,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2025-03-09 00:55:51,731 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 12 predicate places. [2025-03-09 00:55:51,731 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 362 flow [2025-03-09 00:55:51,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:51,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:51,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:51,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:55:51,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:51,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:51,732 INFO L85 PathProgramCache]: Analyzing trace with hash -297778807, now seen corresponding path program 1 times [2025-03-09 00:55:51,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:51,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174988631] [2025-03-09 00:55:51,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:51,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:51,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:55:51,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:55:51,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:51,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:52,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:52,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174988631] [2025-03-09 00:55:52,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174988631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:52,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:52,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:52,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437620837] [2025-03-09 00:55:52,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:52,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:52,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:52,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:52,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2025-03-09 00:55:52,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:52,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:52,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2025-03-09 00:55:52,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand