./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/reorder_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/reorder_5.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:37:24,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:37:24,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:37:24,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:37:24,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:37:24,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:37:24,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:37:24,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:37:24,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:37:24,716 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:37:24,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:37:24,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:37:24,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:37:24,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:37:24,718 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:37:24,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:37:24,719 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:37:24,720 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:37:24,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:37:24,720 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:37:24,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:37:24,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:37:24,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:37:24,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:24,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:37:24,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:37:24,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:37:24,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:37:24,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:24,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:37:24,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:37:24,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:37:24,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:37:24,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:37:24,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:37:24,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:37:24,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:37:24,722 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd [2025-01-10 00:37:24,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:37:24,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:37:24,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:37:24,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:37:24,993 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:37:24,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_5.i [2025-01-10 00:37:26,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c5516a7c/967d57e727564d62a6223b82f56a8721/FLAG5508b7293 [2025-01-10 00:37:26,692 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:37:26,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/reorder_5.i [2025-01-10 00:37:26,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c5516a7c/967d57e727564d62a6223b82f56a8721/FLAG5508b7293 [2025-01-10 00:37:26,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c5516a7c/967d57e727564d62a6223b82f56a8721 [2025-01-10 00:37:26,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:37:26,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:37:26,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:37:26,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:37:26,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:37:26,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:37:26" (1/1) ... [2025-01-10 00:37:26,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:26, skipping insertion in model container [2025-01-10 00:37:26,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:37:26" (1/1) ... [2025-01-10 00:37:26,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:37:27,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:37:27,283 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:37:27,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:37:27,428 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:37:27,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27 WrapperNode [2025-01-10 00:37:27,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:37:27,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:37:27,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:37:27,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:37:27,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,490 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2025-01-10 00:37:27,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:37:27,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:37:27,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:37:27,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:37:27,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,526 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-01-10 00:37:27,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:37:27,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:37:27,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:37:27,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:37:27,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (1/1) ... [2025-01-10 00:37:27,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:27,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:27,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:37:27,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:37:27,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:37:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:37:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:37:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:37:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:37:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:37:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:37:27,628 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-01-10 00:37:27,628 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-01-10 00:37:27,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:37:27,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:37:27,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:37:27,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:37:27,628 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-01-10 00:37:27,629 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-01-10 00:37:27,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:37:27,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:37:27,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:37:27,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:37:27,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:37:27,631 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:37:27,773 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:37:27,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:37:28,020 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:37:28,021 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:37:28,173 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:37:28,173 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:37:28,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:28 BoogieIcfgContainer [2025-01-10 00:37:28,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:37:28,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:37:28,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:37:28,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:37:28,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:37:26" (1/3) ... [2025-01-10 00:37:28,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447ddb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:28, skipping insertion in model container [2025-01-10 00:37:28,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:27" (2/3) ... [2025-01-10 00:37:28,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447ddb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:28, skipping insertion in model container [2025-01-10 00:37:28,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:28" (3/3) ... [2025-01-10 00:37:28,184 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_5.i [2025-01-10 00:37:28,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:37:28,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_5.i that has 3 procedures, 48 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-01-10 00:37:28,198 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:37:28,241 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 00:37:28,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 132 flow [2025-01-10 00:37:28,346 INFO L124 PetriNetUnfolderBase]: 12/131 cut-off events. [2025-01-10 00:37:28,348 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 00:37:28,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 131 events. 12/131 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 632 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 69. Up to 7 conditions per place. [2025-01-10 00:37:28,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 132 flow [2025-01-10 00:37:28,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 132 flow [2025-01-10 00:37:28,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:37:28,375 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;@62c429b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:37:28,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-10 00:37:28,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:37:28,382 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:37:28,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:37:28,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:28,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:37:28,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:28,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:28,389 INFO L85 PathProgramCache]: Analyzing trace with hash 11765734, now seen corresponding path program 1 times [2025-01-10 00:37:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:28,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271477688] [2025-01-10 00:37:28,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:28,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:28,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:37:28,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:37:28,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:28,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:28,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271477688] [2025-01-10 00:37:28,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271477688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:28,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:28,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:37:28,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912592172] [2025-01-10 00:37:28,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:28,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:37:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:28,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:37:28,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:37:28,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2025-01-10 00:37:28,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:28,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:28,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2025-01-10 00:37:28,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:28,722 INFO L124 PetriNetUnfolderBase]: 86/374 cut-off events. [2025-01-10 00:37:28,722 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-10 00:37:28,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 374 events. 86/374 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2592 event pairs, 71 based on Foata normal form. 24/272 useless extension candidates. Maximal degree in co-relation 373. Up to 190 conditions per place. [2025-01-10 00:37:28,726 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 24 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2025-01-10 00:37:28,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 172 flow [2025-01-10 00:37:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:37:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:37:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2025-01-10 00:37:28,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-10 00:37:28,739 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 132 flow. Second operand 2 states and 84 transitions. [2025-01-10 00:37:28,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 172 flow [2025-01-10 00:37:28,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:28,751 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 124 flow [2025-01-10 00:37:28,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2025-01-10 00:37:28,759 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-01-10 00:37:28,759 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 124 flow [2025-01-10 00:37:28,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:28,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:28,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:28,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:37:28,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:28,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:28,761 INFO L85 PathProgramCache]: Analyzing trace with hash 364806638, now seen corresponding path program 1 times [2025-01-10 00:37:28,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:28,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323840670] [2025-01-10 00:37:28,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:28,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:28,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:28,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:28,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:28,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:28,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:28,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323840670] [2025-01-10 00:37:28,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323840670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:28,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:28,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646934620] [2025-01-10 00:37:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:28,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:28,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:28,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:28,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2025-01-10 00:37:28,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:28,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:28,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2025-01-10 00:37:28,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:29,104 INFO L124 PetriNetUnfolderBase]: 97/367 cut-off events. [2025-01-10 00:37:29,104 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 00:37:29,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 367 events. 97/367 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2497 event pairs, 65 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 604. Up to 168 conditions per place. [2025-01-10 00:37:29,107 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-01-10 00:37:29,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 184 flow [2025-01-10 00:37:29,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-01-10 00:37:29,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6130952380952381 [2025-01-10 00:37:29,110 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 124 flow. Second operand 3 states and 103 transitions. [2025-01-10 00:37:29,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 184 flow [2025-01-10 00:37:29,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:29,117 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 124 flow [2025-01-10 00:37:29,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-01-10 00:37:29,118 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-01-10 00:37:29,118 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 124 flow [2025-01-10 00:37:29,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:29,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:29,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:29,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:37:29,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:29,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:29,119 INFO L85 PathProgramCache]: Analyzing trace with hash 364806639, now seen corresponding path program 1 times [2025-01-10 00:37:29,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:29,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523571090] [2025-01-10 00:37:29,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:29,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:29,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:29,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:29,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:29,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:29,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523571090] [2025-01-10 00:37:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523571090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:29,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249144605] [2025-01-10 00:37:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:29,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:29,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:29,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-01-10 00:37:29,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:29,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:29,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-01-10 00:37:29,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:29,728 INFO L124 PetriNetUnfolderBase]: 184/694 cut-off events. [2025-01-10 00:37:29,729 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-01-10 00:37:29,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 694 events. 184/694 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5493 event pairs, 159 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 1169. Up to 215 conditions per place. [2025-01-10 00:37:29,734 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 47 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2025-01-10 00:37:29,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 298 flow [2025-01-10 00:37:29,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-01-10 00:37:29,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7008928571428571 [2025-01-10 00:37:29,736 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 124 flow. Second operand 4 states and 157 transitions. [2025-01-10 00:37:29,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 298 flow [2025-01-10 00:37:29,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:29,740 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 146 flow [2025-01-10 00:37:29,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-01-10 00:37:29,741 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-01-10 00:37:29,741 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 146 flow [2025-01-10 00:37:29,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:29,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:29,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:29,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:37:29,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:29,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash -354148444, now seen corresponding path program 1 times [2025-01-10 00:37:29,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:29,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255016772] [2025-01-10 00:37:29,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:29,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:29,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:37:29,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:37:29,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:29,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:29,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:29,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255016772] [2025-01-10 00:37:29,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255016772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:29,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:29,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:29,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048824529] [2025-01-10 00:37:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:29,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:29,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:29,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:29,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2025-01-10 00:37:29,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:29,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:29,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2025-01-10 00:37:29,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:30,149 INFO L124 PetriNetUnfolderBase]: 226/743 cut-off events. [2025-01-10 00:37:30,149 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-01-10 00:37:30,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 743 events. 226/743 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6014 event pairs, 94 based on Foata normal form. 1/513 useless extension candidates. Maximal degree in co-relation 1312. Up to 488 conditions per place. [2025-01-10 00:37:30,157 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 36 selfloop transitions, 7 changer transitions 2/66 dead transitions. [2025-01-10 00:37:30,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 269 flow [2025-01-10 00:37:30,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-01-10 00:37:30,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6116071428571429 [2025-01-10 00:37:30,165 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 146 flow. Second operand 4 states and 137 transitions. [2025-01-10 00:37:30,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 269 flow [2025-01-10 00:37:30,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:30,167 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 184 flow [2025-01-10 00:37:30,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-01-10 00:37:30,170 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2025-01-10 00:37:30,170 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 184 flow [2025-01-10 00:37:30,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:30,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:30,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:30,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:37:30,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:30,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1906299297, now seen corresponding path program 1 times [2025-01-10 00:37:30,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:30,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516544365] [2025-01-10 00:37:30,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:30,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:30,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:30,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:30,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:30,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:30,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516544365] [2025-01-10 00:37:30,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516544365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:30,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:30,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:30,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725015425] [2025-01-10 00:37:30,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:30,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:30,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:30,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:30,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2025-01-10 00:37:30,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:30,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:30,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2025-01-10 00:37:30,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:30,365 INFO L124 PetriNetUnfolderBase]: 200/664 cut-off events. [2025-01-10 00:37:30,365 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-01-10 00:37:30,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 664 events. 200/664 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5135 event pairs, 142 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 1281. Up to 349 conditions per place. [2025-01-10 00:37:30,370 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 30 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-01-10 00:37:30,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 254 flow [2025-01-10 00:37:30,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-01-10 00:37:30,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6130952380952381 [2025-01-10 00:37:30,377 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 184 flow. Second operand 3 states and 103 transitions. [2025-01-10 00:37:30,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 254 flow [2025-01-10 00:37:30,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 243 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:30,382 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 177 flow [2025-01-10 00:37:30,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=169, 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=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-01-10 00:37:30,383 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2025-01-10 00:37:30,384 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 177 flow [2025-01-10 00:37:30,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:30,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:30,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:30,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:37:30,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:30,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1906299298, now seen corresponding path program 1 times [2025-01-10 00:37:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297668196] [2025-01-10 00:37:30,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:30,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:30,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:30,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:30,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:30,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:30,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297668196] [2025-01-10 00:37:30,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297668196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:30,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432288339] [2025-01-10 00:37:30,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:30,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:30,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:30,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:30,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2025-01-10 00:37:30,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:30,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:30,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2025-01-10 00:37:30,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:30,815 INFO L124 PetriNetUnfolderBase]: 271/768 cut-off events. [2025-01-10 00:37:30,816 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-01-10 00:37:30,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 768 events. 271/768 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5865 event pairs, 36 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 1576. Up to 238 conditions per place. [2025-01-10 00:37:30,821 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 41 selfloop transitions, 16 changer transitions 0/76 dead transitions. [2025-01-10 00:37:30,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 355 flow [2025-01-10 00:37:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-01-10 00:37:30,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-01-10 00:37:30,823 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 177 flow. Second operand 5 states and 170 transitions. [2025-01-10 00:37:30,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 355 flow [2025-01-10 00:37:30,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:30,828 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 266 flow [2025-01-10 00:37:30,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-01-10 00:37:30,829 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-01-10 00:37:30,829 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 266 flow [2025-01-10 00:37:30,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:30,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:30,832 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:30,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:37:30,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:30,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:30,833 INFO L85 PathProgramCache]: Analyzing trace with hash 776963402, now seen corresponding path program 1 times [2025-01-10 00:37:30,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:30,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455732535] [2025-01-10 00:37:30,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:30,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:30,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:30,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:30,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:30,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:31,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:31,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455732535] [2025-01-10 00:37:31,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455732535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:31,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:31,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:31,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999619090] [2025-01-10 00:37:31,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:31,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:37:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:31,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:37:31,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:37:31,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-01-10 00:37:31,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:31,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:31,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-01-10 00:37:31,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:31,372 INFO L124 PetriNetUnfolderBase]: 111/411 cut-off events. [2025-01-10 00:37:31,372 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-01-10 00:37:31,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 411 events. 111/411 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2664 event pairs, 94 based on Foata normal form. 4/382 useless extension candidates. Maximal degree in co-relation 975. Up to 247 conditions per place. [2025-01-10 00:37:31,376 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 39 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-01-10 00:37:31,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 370 flow [2025-01-10 00:37:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-01-10 00:37:31,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-01-10 00:37:31,378 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 266 flow. Second operand 5 states and 165 transitions. [2025-01-10 00:37:31,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 370 flow [2025-01-10 00:37:31,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:31,382 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 274 flow [2025-01-10 00:37:31,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-01-10 00:37:31,384 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2025-01-10 00:37:31,385 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 274 flow [2025-01-10 00:37:31,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:31,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:31,385 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:31,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:37:31,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:31,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:31,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1683938006, now seen corresponding path program 1 times [2025-01-10 00:37:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:31,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004113725] [2025-01-10 00:37:31,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:31,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:37:31,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:37:31,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:31,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:37:31,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:37:31,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:37:31,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:37:31,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:31,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:37:31,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:37:31,456 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:37:31,457 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-01-10 00:37:31,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-01-10 00:37:31,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (12 of 15 remaining) [2025-01-10 00:37:31,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (11 of 15 remaining) [2025-01-10 00:37:31,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-01-10 00:37:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-01-10 00:37:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-01-10 00:37:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-01-10 00:37:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-01-10 00:37:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-01-10 00:37:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-01-10 00:37:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-01-10 00:37:31,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-01-10 00:37:31,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2025-01-10 00:37:31,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2025-01-10 00:37:31,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:37:31,463 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:31,466 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:37:31,466 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:37:31,493 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-10 00:37:31,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 74 transitions, 192 flow [2025-01-10 00:37:31,537 INFO L124 PetriNetUnfolderBase]: 65/432 cut-off events. [2025-01-10 00:37:31,537 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2025-01-10 00:37:31,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 432 events. 65/432 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2621 event pairs, 1 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 267. Up to 32 conditions per place. [2025-01-10 00:37:31,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 74 transitions, 192 flow [2025-01-10 00:37:31,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 74 transitions, 192 flow [2025-01-10 00:37:31,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:37:31,543 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;@62c429b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:37:31,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 00:37:31,544 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:37:31,545 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:37:31,545 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:37:31,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:31,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:37:31,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:31,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:31,547 INFO L85 PathProgramCache]: Analyzing trace with hash 13982182, now seen corresponding path program 1 times [2025-01-10 00:37:31,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:31,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196750135] [2025-01-10 00:37:31,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:31,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:31,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:37:31,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:37:31,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:31,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:31,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:31,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196750135] [2025-01-10 00:37:31,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196750135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:31,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:31,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:37:31,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510196302] [2025-01-10 00:37:31,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:31,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:37:31,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:31,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:37:31,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:37:31,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 74 [2025-01-10 00:37:31,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 192 flow. Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:31,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:31,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 74 [2025-01-10 00:37:31,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:32,035 INFO L124 PetriNetUnfolderBase]: 1996/4885 cut-off events. [2025-01-10 00:37:32,035 INFO L125 PetriNetUnfolderBase]: For 1152/1152 co-relation queries the response was YES. [2025-01-10 00:37:32,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8388 conditions, 4885 events. 1996/4885 cut-off events. For 1152/1152 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 46465 event pairs, 1718 based on Foata normal form. 532/4272 useless extension candidates. Maximal degree in co-relation 3145. Up to 3077 conditions per place. [2025-01-10 00:37:32,072 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 33 selfloop transitions, 0 changer transitions 0/69 dead transitions. [2025-01-10 00:37:32,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 248 flow [2025-01-10 00:37:32,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:37:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:37:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2025-01-10 00:37:32,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7432432432432432 [2025-01-10 00:37:32,073 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 192 flow. Second operand 2 states and 110 transitions. [2025-01-10 00:37:32,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 248 flow [2025-01-10 00:37:32,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:32,077 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 182 flow [2025-01-10 00:37:32,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2025-01-10 00:37:32,080 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -1 predicate places. [2025-01-10 00:37:32,080 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 182 flow [2025-01-10 00:37:32,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:32,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:32,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:32,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:37:32,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:32,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:32,080 INFO L85 PathProgramCache]: Analyzing trace with hash 433516598, now seen corresponding path program 1 times [2025-01-10 00:37:32,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:32,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130008569] [2025-01-10 00:37:32,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:32,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:32,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:32,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:32,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:32,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:32,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130008569] [2025-01-10 00:37:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130008569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:32,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:32,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:32,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119309886] [2025-01-10 00:37:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:32,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:32,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:32,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:32,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 74 [2025-01-10 00:37:32,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:32,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:32,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 74 [2025-01-10 00:37:32,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:32,572 INFO L124 PetriNetUnfolderBase]: 2241/4979 cut-off events. [2025-01-10 00:37:32,572 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2025-01-10 00:37:32,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8879 conditions, 4979 events. 2241/4979 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 45553 event pairs, 1483 based on Foata normal form. 0/4133 useless extension candidates. Maximal degree in co-relation 8872. Up to 2701 conditions per place. [2025-01-10 00:37:32,615 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 39 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-01-10 00:37:32,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 272 flow [2025-01-10 00:37:32,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-01-10 00:37:32,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6261261261261262 [2025-01-10 00:37:32,616 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 182 flow. Second operand 3 states and 139 transitions. [2025-01-10 00:37:32,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 272 flow [2025-01-10 00:37:32,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:32,619 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 182 flow [2025-01-10 00:37:32,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2025-01-10 00:37:32,620 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -1 predicate places. [2025-01-10 00:37:32,620 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 182 flow [2025-01-10 00:37:32,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:32,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:32,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:32,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:37:32,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:32,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash 433516599, now seen corresponding path program 1 times [2025-01-10 00:37:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:32,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660636816] [2025-01-10 00:37:32,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:32,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:32,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:32,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:32,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:32,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660636816] [2025-01-10 00:37:32,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660636816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:32,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:32,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:32,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511520105] [2025-01-10 00:37:32,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:32,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:32,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:32,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:32,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 74 [2025-01-10 00:37:32,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:32,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:32,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 74 [2025-01-10 00:37:32,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:33,687 INFO L124 PetriNetUnfolderBase]: 4433/9798 cut-off events. [2025-01-10 00:37:33,688 INFO L125 PetriNetUnfolderBase]: For 2286/2286 co-relation queries the response was YES. [2025-01-10 00:37:33,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17782 conditions, 9798 events. 4433/9798 cut-off events. For 2286/2286 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 99372 event pairs, 3470 based on Foata normal form. 1/8137 useless extension candidates. Maximal degree in co-relation 17774. Up to 3472 conditions per place. [2025-01-10 00:37:33,761 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 66 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2025-01-10 00:37:33,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 102 transitions, 436 flow [2025-01-10 00:37:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2025-01-10 00:37:33,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2025-01-10 00:37:33,763 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 182 flow. Second operand 4 states and 208 transitions. [2025-01-10 00:37:33,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 102 transitions, 436 flow [2025-01-10 00:37:33,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 102 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:33,783 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 204 flow [2025-01-10 00:37:33,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-01-10 00:37:33,784 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2025-01-10 00:37:33,785 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 204 flow [2025-01-10 00:37:33,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:33,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:33,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:33,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:37:33,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:33,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:33,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2115058780, now seen corresponding path program 1 times [2025-01-10 00:37:33,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:33,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611645510] [2025-01-10 00:37:33,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:33,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:37:33,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:37:33,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:33,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:33,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611645510] [2025-01-10 00:37:33,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611645510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:33,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:33,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:33,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112988466] [2025-01-10 00:37:33,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:33,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:33,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:33,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:33,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 74 [2025-01-10 00:37:33,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:33,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:33,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 74 [2025-01-10 00:37:33,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:34,885 INFO L124 PetriNetUnfolderBase]: 5403/10775 cut-off events. [2025-01-10 00:37:34,886 INFO L125 PetriNetUnfolderBase]: For 1618/1618 co-relation queries the response was YES. [2025-01-10 00:37:34,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20079 conditions, 10775 events. 5403/10775 cut-off events. For 1618/1618 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 105179 event pairs, 4800 based on Foata normal form. 1/8394 useless extension candidates. Maximal degree in co-relation 20069. Up to 8400 conditions per place. [2025-01-10 00:37:34,970 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 46 selfloop transitions, 7 changer transitions 2/84 dead transitions. [2025-01-10 00:37:34,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 84 transitions, 351 flow [2025-01-10 00:37:34,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-01-10 00:37:34,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6047297297297297 [2025-01-10 00:37:34,972 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 204 flow. Second operand 4 states and 179 transitions. [2025-01-10 00:37:34,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 84 transitions, 351 flow [2025-01-10 00:37:34,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 84 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:35,043 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 248 flow [2025-01-10 00:37:35,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-01-10 00:37:35,044 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 6 predicate places. [2025-01-10 00:37:35,044 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 248 flow [2025-01-10 00:37:35,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:35,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:35,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:35,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:37:35,045 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:35,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:35,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1142313495, now seen corresponding path program 1 times [2025-01-10 00:37:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391911339] [2025-01-10 00:37:35,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:35,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:35,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:35,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:35,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:35,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391911339] [2025-01-10 00:37:35,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391911339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:35,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:35,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:35,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8682869] [2025-01-10 00:37:35,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:35,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:35,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:35,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:35,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:35,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 74 [2025-01-10 00:37:35,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:35,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:35,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 74 [2025-01-10 00:37:35,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:35,933 INFO L124 PetriNetUnfolderBase]: 4735/9647 cut-off events. [2025-01-10 00:37:35,933 INFO L125 PetriNetUnfolderBase]: For 1681/1681 co-relation queries the response was YES. [2025-01-10 00:37:35,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18921 conditions, 9647 events. 4735/9647 cut-off events. For 1681/1681 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 93361 event pairs, 3252 based on Foata normal form. 0/8914 useless extension candidates. Maximal degree in co-relation 18909. Up to 5776 conditions per place. [2025-01-10 00:37:36,015 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 43 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-01-10 00:37:36,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 77 transitions, 350 flow [2025-01-10 00:37:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-01-10 00:37:36,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6261261261261262 [2025-01-10 00:37:36,017 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 248 flow. Second operand 3 states and 139 transitions. [2025-01-10 00:37:36,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 77 transitions, 350 flow [2025-01-10 00:37:36,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 77 transitions, 342 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:36,028 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 244 flow [2025-01-10 00:37:36,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2025-01-10 00:37:36,028 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2025-01-10 00:37:36,028 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 244 flow [2025-01-10 00:37:36,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:36,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:36,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:36,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:37:36,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:36,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:36,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1142313494, now seen corresponding path program 1 times [2025-01-10 00:37:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:36,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126262454] [2025-01-10 00:37:36,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:36,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:36,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:36,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:36,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:36,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:36,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:36,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126262454] [2025-01-10 00:37:36,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126262454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:36,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:36,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:36,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474195722] [2025-01-10 00:37:36,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:36,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:36,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:36,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:36,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 74 [2025-01-10 00:37:36,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:36,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:36,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 74 [2025-01-10 00:37:36,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:37,217 INFO L124 PetriNetUnfolderBase]: 7410/13458 cut-off events. [2025-01-10 00:37:37,217 INFO L125 PetriNetUnfolderBase]: For 2709/2709 co-relation queries the response was YES. [2025-01-10 00:37:37,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27829 conditions, 13458 events. 7410/13458 cut-off events. For 2709/2709 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 126376 event pairs, 3132 based on Foata normal form. 0/12035 useless extension candidates. Maximal degree in co-relation 27817. Up to 5622 conditions per place. [2025-01-10 00:37:37,310 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 65 selfloop transitions, 16 changer transitions 0/108 dead transitions. [2025-01-10 00:37:37,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 512 flow [2025-01-10 00:37:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2025-01-10 00:37:37,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6324324324324324 [2025-01-10 00:37:37,312 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 244 flow. Second operand 5 states and 234 transitions. [2025-01-10 00:37:37,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 512 flow [2025-01-10 00:37:37,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 108 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:37,346 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 339 flow [2025-01-10 00:37:37,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2025-01-10 00:37:37,348 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places. [2025-01-10 00:37:37,348 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 339 flow [2025-01-10 00:37:37,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:37,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:37,348 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:37,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:37:37,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:37,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:37,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2023705189, now seen corresponding path program 1 times [2025-01-10 00:37:37,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:37,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970521899] [2025-01-10 00:37:37,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:37,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:37,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:37,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:37,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:37,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970521899] [2025-01-10 00:37:37,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970521899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:37,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:37,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:37:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801729890] [2025-01-10 00:37:37,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:37,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:37:37,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:37,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:37:37,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:37:37,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 74 [2025-01-10 00:37:37,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 339 flow. Second operand has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:37,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:37,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 74 [2025-01-10 00:37:37,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:38,867 INFO L124 PetriNetUnfolderBase]: 6165/12240 cut-off events. [2025-01-10 00:37:38,867 INFO L125 PetriNetUnfolderBase]: For 3842/3842 co-relation queries the response was YES. [2025-01-10 00:37:38,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28710 conditions, 12240 events. 6165/12240 cut-off events. For 3842/3842 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 120306 event pairs, 4728 based on Foata normal form. 10/11297 useless extension candidates. Maximal degree in co-relation 28695. Up to 4877 conditions per place. [2025-01-10 00:37:38,937 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 112 selfloop transitions, 15 changer transitions 0/156 dead transitions. [2025-01-10 00:37:38,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 156 transitions, 935 flow [2025-01-10 00:37:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 272 transitions. [2025-01-10 00:37:38,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7351351351351352 [2025-01-10 00:37:38,939 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 339 flow. Second operand 5 states and 272 transitions. [2025-01-10 00:37:38,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 156 transitions, 935 flow [2025-01-10 00:37:38,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 156 transitions, 926 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:38,950 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 482 flow [2025-01-10 00:37:38,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=482, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2025-01-10 00:37:38,950 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places. [2025-01-10 00:37:38,951 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 482 flow [2025-01-10 00:37:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:38,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:38,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:38,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:37:38,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:38,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:38,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1748318919, now seen corresponding path program 1 times [2025-01-10 00:37:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:38,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241104660] [2025-01-10 00:37:38,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:38,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:37:38,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:37:38,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:38,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:39,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:39,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241104660] [2025-01-10 00:37:39,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241104660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:39,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:39,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:39,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520539177] [2025-01-10 00:37:39,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:39,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:39,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:39,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:39,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:39,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 00:37:39,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 482 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:39,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:39,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 00:37:39,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:40,098 INFO L124 PetriNetUnfolderBase]: 4903/10684 cut-off events. [2025-01-10 00:37:40,098 INFO L125 PetriNetUnfolderBase]: For 6964/6964 co-relation queries the response was YES. [2025-01-10 00:37:40,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27158 conditions, 10684 events. 4903/10684 cut-off events. For 6964/6964 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 107786 event pairs, 3432 based on Foata normal form. 0/10232 useless extension candidates. Maximal degree in co-relation 27141. Up to 5769 conditions per place. [2025-01-10 00:37:40,173 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 56 selfloop transitions, 6 changer transitions 2/96 dead transitions. [2025-01-10 00:37:40,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 96 transitions, 620 flow [2025-01-10 00:37:40,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2025-01-10 00:37:40,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2025-01-10 00:37:40,175 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 482 flow. Second operand 4 states and 180 transitions. [2025-01-10 00:37:40,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 96 transitions, 620 flow [2025-01-10 00:37:40,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 608 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:40,191 INFO L231 Difference]: Finished difference. Result has 86 places, 88 transitions, 465 flow [2025-01-10 00:37:40,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=465, PETRI_PLACES=86, PETRI_TRANSITIONS=88} [2025-01-10 00:37:40,192 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places. [2025-01-10 00:37:40,192 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 88 transitions, 465 flow [2025-01-10 00:37:40,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:40,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:40,192 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:40,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:37:40,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:40,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1600807086, now seen corresponding path program 1 times [2025-01-10 00:37:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110373995] [2025-01-10 00:37:40,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:40,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:37:40,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:37:40,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:40,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:40,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110373995] [2025-01-10 00:37:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110373995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:40,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:40,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:37:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130955425] [2025-01-10 00:37:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:40,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:37:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:40,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:37:40,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:37:40,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 74 [2025-01-10 00:37:40,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 88 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:40,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:40,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 74 [2025-01-10 00:37:40,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:41,727 INFO L124 PetriNetUnfolderBase]: 6469/12037 cut-off events. [2025-01-10 00:37:41,727 INFO L125 PetriNetUnfolderBase]: For 7314/7314 co-relation queries the response was YES. [2025-01-10 00:37:41,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31062 conditions, 12037 events. 6469/12037 cut-off events. For 7314/7314 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 112489 event pairs, 1400 based on Foata normal form. 226/11717 useless extension candidates. Maximal degree in co-relation 31045. Up to 4064 conditions per place. [2025-01-10 00:37:41,786 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 63 selfloop transitions, 25 changer transitions 1/116 dead transitions. [2025-01-10 00:37:41,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 116 transitions, 719 flow [2025-01-10 00:37:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2025-01-10 00:37:41,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6297297297297297 [2025-01-10 00:37:41,787 INFO L175 Difference]: Start difference. First operand has 86 places, 88 transitions, 465 flow. Second operand 5 states and 233 transitions. [2025-01-10 00:37:41,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 116 transitions, 719 flow [2025-01-10 00:37:41,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 116 transitions, 707 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:37:41,837 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 522 flow [2025-01-10 00:37:41,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=522, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2025-01-10 00:37:41,837 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 17 predicate places. [2025-01-10 00:37:41,837 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 522 flow [2025-01-10 00:37:41,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:41,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:41,838 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:41,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:37:41,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:41,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash 853827644, now seen corresponding path program 1 times [2025-01-10 00:37:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:41,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780618702] [2025-01-10 00:37:41,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:41,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:37:41,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:37:41,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:41,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:42,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:42,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780618702] [2025-01-10 00:37:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780618702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:42,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:37:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992765038] [2025-01-10 00:37:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:42,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:37:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:42,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:37:42,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:37:42,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 74 [2025-01-10 00:37:42,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:42,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:42,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 74 [2025-01-10 00:37:42,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:43,057 INFO L124 PetriNetUnfolderBase]: 6802/12006 cut-off events. [2025-01-10 00:37:43,057 INFO L125 PetriNetUnfolderBase]: For 10663/10663 co-relation queries the response was YES. [2025-01-10 00:37:43,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33691 conditions, 12006 events. 6802/12006 cut-off events. For 10663/10663 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 109877 event pairs, 2034 based on Foata normal form. 373/12013 useless extension candidates. Maximal degree in co-relation 33672. Up to 4217 conditions per place. [2025-01-10 00:37:43,138 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 62 selfloop transitions, 24 changer transitions 1/113 dead transitions. [2025-01-10 00:37:43,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 113 transitions, 768 flow [2025-01-10 00:37:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2025-01-10 00:37:43,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2025-01-10 00:37:43,139 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 522 flow. Second operand 5 states and 232 transitions. [2025-01-10 00:37:43,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 113 transitions, 768 flow [2025-01-10 00:37:43,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 113 transitions, 715 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:37:43,169 INFO L231 Difference]: Finished difference. Result has 86 places, 84 transitions, 498 flow [2025-01-10 00:37:43,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=498, PETRI_PLACES=86, PETRI_TRANSITIONS=84} [2025-01-10 00:37:43,170 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places. [2025-01-10 00:37:43,170 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 84 transitions, 498 flow [2025-01-10 00:37:43,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:43,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:43,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:43,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:37:43,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:43,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:43,171 INFO L85 PathProgramCache]: Analyzing trace with hash -777342426, now seen corresponding path program 1 times [2025-01-10 00:37:43,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:43,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342634947] [2025-01-10 00:37:43,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:43,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:43,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:37:43,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:37:43,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:43,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:43,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:43,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342634947] [2025-01-10 00:37:43,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342634947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:43,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:43,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:43,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082956116] [2025-01-10 00:37:43,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:43,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:43,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:43,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:43,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:43,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 74 [2025-01-10 00:37:43,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 498 flow. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:43,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:43,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 74 [2025-01-10 00:37:43,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:44,063 INFO L124 PetriNetUnfolderBase]: 5597/10913 cut-off events. [2025-01-10 00:37:44,063 INFO L125 PetriNetUnfolderBase]: For 11723/11723 co-relation queries the response was YES. [2025-01-10 00:37:44,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30925 conditions, 10913 events. 5597/10913 cut-off events. For 11723/11723 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 102606 event pairs, 2294 based on Foata normal form. 148/10661 useless extension candidates. Maximal degree in co-relation 30907. Up to 3618 conditions per place. [2025-01-10 00:37:44,124 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 77 selfloop transitions, 20 changer transitions 5/129 dead transitions. [2025-01-10 00:37:44,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 129 transitions, 925 flow [2025-01-10 00:37:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2025-01-10 00:37:44,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672972972972973 [2025-01-10 00:37:44,125 INFO L175 Difference]: Start difference. First operand has 86 places, 84 transitions, 498 flow. Second operand 5 states and 249 transitions. [2025-01-10 00:37:44,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 129 transitions, 925 flow [2025-01-10 00:37:44,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 129 transitions, 842 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-01-10 00:37:44,154 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 578 flow [2025-01-10 00:37:44,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=578, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2025-01-10 00:37:44,155 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 18 predicate places. [2025-01-10 00:37:44,155 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 578 flow [2025-01-10 00:37:44,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:44,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:44,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:44,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:37:44,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:44,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash 698851814, now seen corresponding path program 1 times [2025-01-10 00:37:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:44,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534353665] [2025-01-10 00:37:44,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:44,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:37:44,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:37:44,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:44,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:44,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534353665] [2025-01-10 00:37:44,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534353665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:44,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:44,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:37:44,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631898642] [2025-01-10 00:37:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:44,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:44,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:44,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:44,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:44,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 00:37:44,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 578 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:44,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:44,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 00:37:44,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:45,363 INFO L124 PetriNetUnfolderBase]: 6576/12734 cut-off events. [2025-01-10 00:37:45,363 INFO L125 PetriNetUnfolderBase]: For 15935/15935 co-relation queries the response was YES. [2025-01-10 00:37:45,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35290 conditions, 12734 events. 6576/12734 cut-off events. For 15935/15935 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 123554 event pairs, 2165 based on Foata normal form. 12/12414 useless extension candidates. Maximal degree in co-relation 35271. Up to 3769 conditions per place. [2025-01-10 00:37:45,413 INFO L140 encePairwiseOnDemand]: 64/74 looper letters, 83 selfloop transitions, 23 changer transitions 0/134 dead transitions. [2025-01-10 00:37:45,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 134 transitions, 950 flow [2025-01-10 00:37:45,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 269 transitions. [2025-01-10 00:37:45,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.727027027027027 [2025-01-10 00:37:45,414 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 578 flow. Second operand 5 states and 269 transitions. [2025-01-10 00:37:45,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 134 transitions, 950 flow [2025-01-10 00:37:45,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 134 transitions, 917 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:45,436 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 621 flow [2025-01-10 00:37:45,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=621, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2025-01-10 00:37:45,437 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 21 predicate places. [2025-01-10 00:37:45,437 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 621 flow [2025-01-10 00:37:45,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:45,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:45,438 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:45,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:37:45,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:45,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:45,439 INFO L85 PathProgramCache]: Analyzing trace with hash 473361879, now seen corresponding path program 1 times [2025-01-10 00:37:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:45,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868967641] [2025-01-10 00:37:45,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:45,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:45,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:37:45,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:37:45,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:45,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:37:45,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:37:45,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:37:45,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:37:45,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:45,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:37:45,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:37:45,468 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:37:45,468 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-10 00:37:45,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2025-01-10 00:37:45,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (13 of 16 remaining) [2025-01-10 00:37:45,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (12 of 16 remaining) [2025-01-10 00:37:45,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-01-10 00:37:45,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-01-10 00:37:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-01-10 00:37:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-01-10 00:37:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-01-10 00:37:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-01-10 00:37:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-01-10 00:37:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-01-10 00:37:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2025-01-10 00:37:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2025-01-10 00:37:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 16 remaining) [2025-01-10 00:37:45,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-01-10 00:37:45,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:37:45,469 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:45,470 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:37:45,470 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:37:45,502 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-10 00:37:45,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 92 transitions, 256 flow [2025-01-10 00:37:45,585 INFO L124 PetriNetUnfolderBase]: 350/1531 cut-off events. [2025-01-10 00:37:45,585 INFO L125 PetriNetUnfolderBase]: For 419/431 co-relation queries the response was YES. [2025-01-10 00:37:45,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1531 events. 350/1531 cut-off events. For 419/431 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11385 event pairs, 32 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 984. Up to 192 conditions per place. [2025-01-10 00:37:45,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 92 transitions, 256 flow [2025-01-10 00:37:45,604 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 92 transitions, 256 flow [2025-01-10 00:37:45,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:37:45,605 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;@62c429b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:37:45,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 00:37:45,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:37:45,606 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:37:45,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:37:45,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:45,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:37:45,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 14 more)] === [2025-01-10 00:37:45,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:45,607 INFO L85 PathProgramCache]: Analyzing trace with hash 16752742, now seen corresponding path program 1 times [2025-01-10 00:37:45,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:45,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397505656] [2025-01-10 00:37:45,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:45,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:37:45,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:37:45,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:45,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:45,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:45,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397505656] [2025-01-10 00:37:45,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397505656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:45,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:45,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:37:45,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686041894] [2025-01-10 00:37:45,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:45,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:37:45,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:45,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:37:45,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:37:45,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 92 [2025-01-10 00:37:45,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 256 flow. Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:45,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:45,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 92 [2025-01-10 00:37:45,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:49,672 INFO L124 PetriNetUnfolderBase]: 34066/64642 cut-off events. [2025-01-10 00:37:49,672 INFO L125 PetriNetUnfolderBase]: For 20374/20374 co-relation queries the response was YES. [2025-01-10 00:37:49,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117260 conditions, 64642 events. 34066/64642 cut-off events. For 20374/20374 co-relation queries the response was YES. Maximal size of possible extension queue 2980. Compared 708824 event pairs, 29642 based on Foata normal form. 8875/62909 useless extension candidates. Maximal degree in co-relation 36918. Up to 45834 conditions per place. [2025-01-10 00:37:50,128 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 42 selfloop transitions, 0 changer transitions 0/86 dead transitions. [2025-01-10 00:37:50,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 86 transitions, 328 flow [2025-01-10 00:37:50,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:37:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:37:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2025-01-10 00:37:50,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7391304347826086 [2025-01-10 00:37:50,129 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 256 flow. Second operand 2 states and 136 transitions. [2025-01-10 00:37:50,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 86 transitions, 328 flow [2025-01-10 00:37:50,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 86 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:50,134 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 244 flow [2025-01-10 00:37:50,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=244, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2025-01-10 00:37:50,135 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -1 predicate places. [2025-01-10 00:37:50,135 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 244 flow [2025-01-10 00:37:50,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:50,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:50,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:50,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:37:50,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 14 more)] === [2025-01-10 00:37:50,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:50,136 INFO L85 PathProgramCache]: Analyzing trace with hash 519404049, now seen corresponding path program 1 times [2025-01-10 00:37:50,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:50,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029014885] [2025-01-10 00:37:50,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:50,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:50,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:50,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:50,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:50,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029014885] [2025-01-10 00:37:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029014885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:50,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:50,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:50,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364715862] [2025-01-10 00:37:50,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:50,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:50,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:50,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:50,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:50,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 92 [2025-01-10 00:37:50,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:50,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:50,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 92 [2025-01-10 00:37:50,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:59,052 INFO L124 PetriNetUnfolderBase]: 76586/137402 cut-off events. [2025-01-10 00:37:59,052 INFO L125 PetriNetUnfolderBase]: For 40603/40603 co-relation queries the response was YES. [2025-01-10 00:37:59,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254403 conditions, 137402 events. 76586/137402 cut-off events. For 40603/40603 co-relation queries the response was YES. Maximal size of possible extension queue 6307. Compared 1562445 event pairs, 63128 based on Foata normal form. 1/119526 useless extension candidates. Maximal degree in co-relation 254394. Up to 51913 conditions per place. [2025-01-10 00:38:00,080 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 84 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2025-01-10 00:38:00,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 130 transitions, 574 flow [2025-01-10 00:38:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:38:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:38:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2025-01-10 00:38:00,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7010869565217391 [2025-01-10 00:38:00,081 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 244 flow. Second operand 4 states and 258 transitions. [2025-01-10 00:38:00,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 130 transitions, 574 flow [2025-01-10 00:38:00,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 130 transitions, 574 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:00,085 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 270 flow [2025-01-10 00:38:00,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-01-10 00:38:00,086 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places. [2025-01-10 00:38:00,086 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 270 flow [2025-01-10 00:38:00,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:00,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:00,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:38:00,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 00:38:00,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 14 more)] === [2025-01-10 00:38:00,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash 519404048, now seen corresponding path program 1 times [2025-01-10 00:38:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:00,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679513963] [2025-01-10 00:38:00,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:00,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:38:00,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:38:00,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:00,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:00,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:00,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679513963] [2025-01-10 00:38:00,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679513963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:00,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:00,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:00,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701517122] [2025-01-10 00:38:00,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:00,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:00,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:00,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:00,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:00,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 92 [2025-01-10 00:38:00,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:00,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:00,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 92 [2025-01-10 00:38:00,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:08,911 INFO L124 PetriNetUnfolderBase]: 76586/133916 cut-off events. [2025-01-10 00:38:08,912 INFO L125 PetriNetUnfolderBase]: For 28494/28494 co-relation queries the response was YES. [2025-01-10 00:38:09,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251015 conditions, 133916 events. 76586/133916 cut-off events. For 28494/28494 co-relation queries the response was YES. Maximal size of possible extension queue 6118. Compared 1478952 event pairs, 50524 based on Foata normal form. 0/119930 useless extension candidates. Maximal degree in co-relation 251003. Up to 79291 conditions per place. [2025-01-10 00:38:09,908 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 52 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-01-10 00:38:09,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 394 flow [2025-01-10 00:38:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-01-10 00:38:09,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6340579710144928 [2025-01-10 00:38:09,909 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 270 flow. Second operand 3 states and 175 transitions. [2025-01-10 00:38:09,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 394 flow [2025-01-10 00:38:09,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 95 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:09,917 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 270 flow [2025-01-10 00:38:09,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2025-01-10 00:38:09,917 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 3 predicate places. [2025-01-10 00:38:09,917 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 270 flow [2025-01-10 00:38:09,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:09,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:09,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:09,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 00:38:09,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 14 more)] === [2025-01-10 00:38:09,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1052512420, now seen corresponding path program 1 times [2025-01-10 00:38:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:09,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801957202] [2025-01-10 00:38:09,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:09,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:38:09,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:38:09,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:09,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:10,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:10,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801957202] [2025-01-10 00:38:10,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801957202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:10,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:10,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216887794] [2025-01-10 00:38:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:10,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:38:10,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:10,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:38:10,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:38:10,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 92 [2025-01-10 00:38:10,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:10,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:10,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 92 [2025-01-10 00:38:10,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand