./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-4.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:00:39,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:00:39,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 20:00:39,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:00:39,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:00:39,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:00:39,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:00:39,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:00:39,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:00:39,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:00:39,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:00:39,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:00:39,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:00:39,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:00:39,360 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:00:39,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:00:39,361 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:00:39,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:00:39,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:00:39,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:00:39,362 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 20:00:39,362 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 20:00:39,363 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 20:00:39,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:00:39,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 20:00:39,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:00:39,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:00:39,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:00:39,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:00:39,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:00:39,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:00:39,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:00:39,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:00:39,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:00:39,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:00:39,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:00:39,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:00:39,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:00:39,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:00:39,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:00:39,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:00:39,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:00:39,369 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 [2024-10-11 20:00:39,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:00:39,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:00:39,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:00:39,622 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:00:39,622 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:00:39,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-4.wvr.c [2024-10-11 20:00:41,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:00:41,296 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:00:41,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-4.wvr.c [2024-10-11 20:00:41,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a0ac0466a/9f3e3c2dbb0d475289a1991e98fc41f3/FLAG1d22524e3 [2024-10-11 20:00:41,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a0ac0466a/9f3e3c2dbb0d475289a1991e98fc41f3 [2024-10-11 20:00:41,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:00:41,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:00:41,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:00:41,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:00:41,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:00:41,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8b7fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41, skipping insertion in model container [2024-10-11 20:00:41,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:00:41,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:00:41,544 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:00:41,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:00:41,580 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:00:41,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41 WrapperNode [2024-10-11 20:00:41,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:00:41,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:00:41,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:00:41,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:00:41,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,617 INFO L138 Inliner]: procedures = 22, calls = 23, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 100 [2024-10-11 20:00:41,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:00:41,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:00:41,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:00:41,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:00:41,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,647 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:00:41,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:00:41,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:00:41,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:00:41,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:00:41,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (1/1) ... [2024-10-11 20:00:41,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:00:41,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:00:41,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:00:41,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:00:41,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:00:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 20:00:41,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 20:00:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 20:00:41,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 20:00:41,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 20:00:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 20:00:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-11 20:00:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-11 20:00:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:00:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 20:00:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 20:00:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:00:41,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:00:41,769 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 20:00:41,874 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:00:41,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:00:42,156 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 20:00:42,156 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:00:42,308 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:00:42,309 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 20:00:42,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:00:42 BoogieIcfgContainer [2024-10-11 20:00:42,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:00:42,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:00:42,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:00:42,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:00:42,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:00:41" (1/3) ... [2024-10-11 20:00:42,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afe339b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:00:42, skipping insertion in model container [2024-10-11 20:00:42,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:00:41" (2/3) ... [2024-10-11 20:00:42,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afe339b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:00:42, skipping insertion in model container [2024-10-11 20:00:42,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:00:42" (3/3) ... [2024-10-11 20:00:42,318 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-10-11 20:00:42,334 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:00:42,335 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 20:00:42,335 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 20:00:42,392 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 20:00:42,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 112 flow [2024-10-11 20:00:42,464 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2024-10-11 20:00:42,465 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 20:00:42,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 38 events. 4/38 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-10-11 20:00:42,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 112 flow [2024-10-11 20:00:42,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 98 flow [2024-10-11 20:00:42,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:00:42,491 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;@55016d30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:00:42,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 20:00:42,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 20:00:42,505 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2024-10-11 20:00:42,505 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 20:00:42,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:00:42,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:00:42,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:00:42,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:00:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1923112110, now seen corresponding path program 1 times [2024-10-11 20:00:42,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:00:42,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022248844] [2024-10-11 20:00:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:00:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:00:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:00:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:00:43,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:00:43,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022248844] [2024-10-11 20:00:43,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022248844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:00:43,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:00:43,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:00:43,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873148414] [2024-10-11 20:00:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:00:43,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:00:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:00:43,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:00:43,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:00:43,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-10-11 20:00:43,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:00:43,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:00:43,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-10-11 20:00:43,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:00:43,645 INFO L124 PetriNetUnfolderBase]: 3042/4219 cut-off events. [2024-10-11 20:00:43,646 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2024-10-11 20:00:43,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8619 conditions, 4219 events. 3042/4219 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 18643 event pairs, 763 based on Foata normal form. 153/4362 useless extension candidates. Maximal degree in co-relation 7613. Up to 3203 conditions per place. [2024-10-11 20:00:43,686 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 46 selfloop transitions, 3 changer transitions 2/56 dead transitions. [2024-10-11 20:00:43,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 259 flow [2024-10-11 20:00:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:00:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:00:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-10-11 20:00:43,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2024-10-11 20:00:43,700 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 98 flow. Second operand 3 states and 85 transitions. [2024-10-11 20:00:43,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 259 flow [2024-10-11 20:00:43,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 229 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 20:00:43,713 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 101 flow [2024-10-11 20:00:43,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2024-10-11 20:00:43,722 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2024-10-11 20:00:43,723 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 101 flow [2024-10-11 20:00:43,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:00:43,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:00:43,723 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:00:43,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:00:43,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:00:43,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:00:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash -56319925, now seen corresponding path program 1 times [2024-10-11 20:00:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:00:43,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887377275] [2024-10-11 20:00:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:00:43,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:00:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:00:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:00:43,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:00:43,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887377275] [2024-10-11 20:00:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887377275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:00:43,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:00:43,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:00:43,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037009703] [2024-10-11 20:00:43,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:00:43,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:00:43,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:00:43,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:00:43,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:00:43,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:00:43,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:00:43,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:00:43,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:00:43,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:00:44,960 INFO L124 PetriNetUnfolderBase]: 10543/14139 cut-off events. [2024-10-11 20:00:44,960 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-10-11 20:00:44,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29877 conditions, 14139 events. 10543/14139 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 70055 event pairs, 3938 based on Foata normal form. 0/11459 useless extension candidates. Maximal degree in co-relation 18632. Up to 6801 conditions per place. [2024-10-11 20:00:45,157 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 72 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2024-10-11 20:00:45,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 80 transitions, 354 flow [2024-10-11 20:00:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:00:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 20:00:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-10-11 20:00:45,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2024-10-11 20:00:45,163 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 101 flow. Second operand 4 states and 110 transitions. [2024-10-11 20:00:45,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 80 transitions, 354 flow [2024-10-11 20:00:45,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 80 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 20:00:45,167 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 122 flow [2024-10-11 20:00:45,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2024-10-11 20:00:45,169 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2024-10-11 20:00:45,169 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 122 flow [2024-10-11 20:00:45,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:00:45,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:00:45,170 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:00:45,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:00:45,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:00:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:00:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -563988891, now seen corresponding path program 2 times [2024-10-11 20:00:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:00:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264966033] [2024-10-11 20:00:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:00:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:00:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:00:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:00:45,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:00:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264966033] [2024-10-11 20:00:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264966033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:00:45,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:00:45,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:00:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901888732] [2024-10-11 20:00:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:00:45,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:00:45,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:00:45,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:00:45,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:00:45,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:00:45,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:00:45,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:00:45,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:00:45,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:00:46,998 INFO L124 PetriNetUnfolderBase]: 14796/20091 cut-off events. [2024-10-11 20:00:46,999 INFO L125 PetriNetUnfolderBase]: For 6443/6451 co-relation queries the response was YES. [2024-10-11 20:00:47,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48754 conditions, 20091 events. 14796/20091 cut-off events. For 6443/6451 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 106112 event pairs, 3089 based on Foata normal form. 567/20526 useless extension candidates. Maximal degree in co-relation 10922. Up to 12283 conditions per place. [2024-10-11 20:00:47,129 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 70 selfloop transitions, 6 changer transitions 4/85 dead transitions. [2024-10-11 20:00:47,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 85 transitions, 421 flow [2024-10-11 20:00:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:00:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 20:00:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-11 20:00:47,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2024-10-11 20:00:47,131 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 122 flow. Second operand 4 states and 109 transitions. [2024-10-11 20:00:47,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 85 transitions, 421 flow [2024-10-11 20:00:47,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 85 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 20:00:47,137 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 176 flow [2024-10-11 20:00:47,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-10-11 20:00:47,138 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2024-10-11 20:00:47,139 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 176 flow [2024-10-11 20:00:47,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:00:47,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:00:47,140 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:00:47,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:00:47,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:00:47,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:00:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1618546033, now seen corresponding path program 1 times [2024-10-11 20:00:47,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:00:47,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31667588] [2024-10-11 20:00:47,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:00:47,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:00:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:00:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:00:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:00:47,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31667588] [2024-10-11 20:00:47,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31667588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:00:47,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:00:47,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:00:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8678257] [2024-10-11 20:00:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:00:47,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:00:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:00:47,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:00:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:00:47,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:00:47,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-10-11 20:00:47,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:00:47,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:00:47,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:00:49,735 INFO L124 PetriNetUnfolderBase]: 22410/30186 cut-off events. [2024-10-11 20:00:49,735 INFO L125 PetriNetUnfolderBase]: For 25790/25806 co-relation queries the response was YES. [2024-10-11 20:00:49,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84488 conditions, 30186 events. 22410/30186 cut-off events. For 25790/25806 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 169670 event pairs, 6609 based on Foata normal form. 654/29945 useless extension candidates. Maximal degree in co-relation 27623. Up to 17582 conditions per place. [2024-10-11 20:00:50,071 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 89 selfloop transitions, 3 changer transitions 16/113 dead transitions. [2024-10-11 20:00:50,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 113 transitions, 641 flow [2024-10-11 20:00:50,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:00:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 20:00:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-10-11 20:00:50,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-10-11 20:00:50,076 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 176 flow. Second operand 5 states and 135 transitions. [2024-10-11 20:00:50,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 113 transitions, 641 flow [2024-10-11 20:00:50,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 113 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 20:00:50,102 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 224 flow [2024-10-11 20:00:50,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-10-11 20:00:50,103 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2024-10-11 20:00:50,104 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 224 flow [2024-10-11 20:00:50,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-10-11 20:00:50,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:00:50,105 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:00:50,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:00:50,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:00:50,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:00:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash -343658013, now seen corresponding path program 2 times [2024-10-11 20:00:50,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:00:50,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315063141] [2024-10-11 20:00:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:00:50,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:00:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:00:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:00:50,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:00:50,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315063141] [2024-10-11 20:00:50,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315063141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:00:50,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:00:50,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:00:50,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184840852] [2024-10-11 20:00:50,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:00:50,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:00:50,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:00:50,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:00:50,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:00:50,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:00:50,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:00:50,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:00:50,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:00:50,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:00:52,254 INFO L124 PetriNetUnfolderBase]: 23554/31984 cut-off events. [2024-10-11 20:00:52,255 INFO L125 PetriNetUnfolderBase]: For 49018/49310 co-relation queries the response was YES. [2024-10-11 20:00:52,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105683 conditions, 31984 events. 23554/31984 cut-off events. For 49018/49310 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 182623 event pairs, 9769 based on Foata normal form. 729/31731 useless extension candidates. Maximal degree in co-relation 35509. Up to 17389 conditions per place. [2024-10-11 20:00:52,485 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 82 selfloop transitions, 11 changer transitions 0/98 dead transitions. [2024-10-11 20:00:52,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 98 transitions, 666 flow [2024-10-11 20:00:52,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:00:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 20:00:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-10-11 20:00:52,487 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-10-11 20:00:52,487 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 224 flow. Second operand 4 states and 108 transitions. [2024-10-11 20:00:52,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 98 transitions, 666 flow [2024-10-11 20:00:52,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 660 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 20:00:52,515 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 334 flow [2024-10-11 20:00:52,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=334, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2024-10-11 20:00:52,517 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-10-11 20:00:52,517 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 334 flow [2024-10-11 20:00:52,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:00:52,518 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:00:52,519 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:00:52,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:00:52,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:00:52,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:00:52,521 INFO L85 PathProgramCache]: Analyzing trace with hash -289153903, now seen corresponding path program 3 times [2024-10-11 20:00:52,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:00:52,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457671156] [2024-10-11 20:00:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:00:52,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:00:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:00:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:00:52,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:00:52,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457671156] [2024-10-11 20:00:52,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457671156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:00:52,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:00:52,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:00:52,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248769042] [2024-10-11 20:00:52,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:00:52,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:00:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:00:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:00:52,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:00:52,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:00:52,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:00:52,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:00:52,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:00:52,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:00:55,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L52-->L55: Formula: (and (= (+ v_~c~0_42 v_~counter~0_47) v_~counter~0_48) (not (= (ite (< 0 (mod v_~counter~0_48 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_48} OutVars{~counter~0=v_~counter~0_47, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][69], [24#L44true, 18#L55true, Black: 67#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 64#true, 79#true, 66#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 84#true, Black: 75#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 74#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 73#(= thread1Thread1of1ForFork0_~i~0 0), 5#thread4EXITtrue, 38#L65true, Black: 81#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 15#L94-4true, Black: 56#(= ~counter~0 0), Black: 60#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 61#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296))]) [2024-10-11 20:00:55,035 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-11 20:00:55,035 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-11 20:00:55,035 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-11 20:00:55,035 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-11 20:00:55,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L52-->L55: Formula: (and (= (+ v_~c~0_42 v_~counter~0_47) v_~counter~0_48) (not (= (ite (< 0 (mod v_~counter~0_48 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_48} OutVars{~counter~0=v_~counter~0_47, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][69], [24#L44true, 18#L55true, Black: 64#true, Black: 66#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 79#true, 84#true, Black: 75#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 74#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 73#(= thread1Thread1of1ForFork0_~i~0 0), 38#L65true, 5#thread4EXITtrue, Black: 81#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 15#L94-4true, 67#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 56#(= ~counter~0 0), Black: 60#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 61#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296))]) [2024-10-11 20:00:55,037 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-11 20:00:55,037 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-11 20:00:55,037 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-11 20:00:55,038 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-11 20:00:55,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L52-->L55: Formula: (and (= (+ v_~c~0_42 v_~counter~0_47) v_~counter~0_48) (not (= (ite (< 0 (mod v_~counter~0_48 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_48} OutVars{~counter~0=v_~counter~0_47, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][69], [24#L44true, 18#L55true, Black: 67#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 64#true, 79#true, 66#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 84#true, Black: 75#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 74#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 73#(= thread1Thread1of1ForFork0_~i~0 0), 38#L65true, 5#thread4EXITtrue, Black: 81#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 28#L95true, Black: 56#(= ~counter~0 0), Black: 60#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 61#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296))]) [2024-10-11 20:00:55,039 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-11 20:00:55,039 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-11 20:00:55,039 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-11 20:00:55,039 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-11 20:00:55,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L52-->L55: Formula: (and (= (+ v_~c~0_42 v_~counter~0_47) v_~counter~0_48) (not (= (ite (< 0 (mod v_~counter~0_48 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_48} OutVars{~counter~0=v_~counter~0_47, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][69], [24#L44true, 18#L55true, Black: 64#true, Black: 66#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 79#true, 84#true, Black: 75#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 74#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 73#(= thread1Thread1of1ForFork0_~i~0 0), 5#thread4EXITtrue, 38#L65true, Black: 81#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 28#L95true, 67#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 56#(= ~counter~0 0), Black: 60#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 61#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296))]) [2024-10-11 20:00:55,040 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-11 20:00:55,040 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-11 20:00:55,040 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-11 20:00:55,040 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-11 20:00:55,041 INFO L124 PetriNetUnfolderBase]: 26317/35534 cut-off events. [2024-10-11 20:00:55,041 INFO L125 PetriNetUnfolderBase]: For 85658/85670 co-relation queries the response was YES. [2024-10-11 20:00:55,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129355 conditions, 35534 events. 26317/35534 cut-off events. For 85658/85670 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 201189 event pairs, 10053 based on Foata normal form. 666/35429 useless extension candidates. Maximal degree in co-relation 42168. Up to 22522 conditions per place. [2024-10-11 20:00:55,494 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 95 selfloop transitions, 18 changer transitions 0/118 dead transitions. [2024-10-11 20:00:55,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 118 transitions, 983 flow [2024-10-11 20:00:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:00:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 20:00:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-10-11 20:00:55,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2024-10-11 20:00:55,496 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 334 flow. Second operand 4 states and 111 transitions. [2024-10-11 20:00:55,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 118 transitions, 983 flow [2024-10-11 20:00:55,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 118 transitions, 937 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-10-11 20:00:55,540 INFO L231 Difference]: Finished difference. Result has 59 places, 67 transitions, 544 flow [2024-10-11 20:00:55,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=544, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2024-10-11 20:00:55,541 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2024-10-11 20:00:55,541 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 544 flow [2024-10-11 20:00:55,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:00:55,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:00:55,541 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:00:55,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:00:55,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:00:55,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:00:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1172694023, now seen corresponding path program 4 times [2024-10-11 20:00:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:00:55,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360956104] [2024-10-11 20:00:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:00:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:00:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:00:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:00:55,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:00:55,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360956104] [2024-10-11 20:00:55,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360956104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:00:55,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:00:55,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:00:55,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333715229] [2024-10-11 20:00:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:00:55,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:00:55,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:00:55,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:00:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:00:55,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:00:55,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 544 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:00:55,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:00:55,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:00:55,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:00:58,204 INFO L124 PetriNetUnfolderBase]: 29658/40029 cut-off events. [2024-10-11 20:00:58,205 INFO L125 PetriNetUnfolderBase]: For 115907/115951 co-relation queries the response was YES. [2024-10-11 20:00:58,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155890 conditions, 40029 events. 29658/40029 cut-off events. For 115907/115951 co-relation queries the response was YES. Maximal size of possible extension queue 1489. Compared 231659 event pairs, 7931 based on Foata normal form. 686/39809 useless extension candidates. Maximal degree in co-relation 50945. Up to 26452 conditions per place. [2024-10-11 20:00:58,505 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 87 selfloop transitions, 14 changer transitions 6/112 dead transitions. [2024-10-11 20:00:58,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 112 transitions, 994 flow [2024-10-11 20:00:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:00:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 20:00:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-11 20:00:58,506 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2024-10-11 20:00:58,507 INFO L175 Difference]: Start difference. First operand has 59 places, 67 transitions, 544 flow. Second operand 4 states and 109 transitions. [2024-10-11 20:00:58,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 112 transitions, 994 flow [2024-10-11 20:00:58,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 112 transitions, 984 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 20:00:58,569 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 588 flow [2024-10-11 20:00:58,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=588, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2024-10-11 20:00:58,573 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2024-10-11 20:00:58,573 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 588 flow [2024-10-11 20:00:58,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:00:58,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:00:58,573 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:00:58,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:00:58,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:00:58,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:00:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1543785007, now seen corresponding path program 3 times [2024-10-11 20:00:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:00:58,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878458725] [2024-10-11 20:00:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:00:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:00:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:00:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:00:58,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:00:58,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878458725] [2024-10-11 20:00:58,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878458725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:00:58,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:00:58,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:00:58,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055454691] [2024-10-11 20:00:58,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:00:58,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:00:58,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:00:58,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:00:58,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:00:58,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:00:58,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-10-11 20:00:58,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:00:58,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:00:58,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:01:01,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L52-->L55: Formula: (and (= (+ v_~c~0_42 v_~counter~0_47) v_~counter~0_48) (not (= (ite (< 0 (mod v_~counter~0_48 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_48} OutVars{~counter~0=v_~counter~0_47, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][75], [24#L44true, 18#L55true, Black: 67#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 64#true, 91#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 66#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 75#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 74#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 95#true, Black: 73#(= thread1Thread1of1ForFork0_~i~0 0), 5#thread4EXITtrue, 38#L65true, Black: 81#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 15#L94-4true, Black: 86#(= thread1Thread1of1ForFork0_~i~0 0), Black: 56#(= ~counter~0 0), Black: 60#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 92#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 61#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296))]) [2024-10-11 20:01:01,723 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-11 20:01:01,723 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-11 20:01:01,723 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-11 20:01:01,723 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-11 20:01:01,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L52-->L55: Formula: (and (= (+ v_~c~0_42 v_~counter~0_47) v_~counter~0_48) (not (= (ite (< 0 (mod v_~counter~0_48 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_48} OutVars{~counter~0=v_~counter~0_47, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][75], [24#L44true, 18#L55true, Black: 64#true, Black: 66#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 91#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 75#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 95#true, Black: 74#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 73#(= thread1Thread1of1ForFork0_~i~0 0), 5#thread4EXITtrue, 38#L65true, Black: 81#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 15#L94-4true, Black: 86#(= thread1Thread1of1ForFork0_~i~0 0), 67#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 56#(= ~counter~0 0), Black: 92#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 60#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 61#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296))]) [2024-10-11 20:01:01,727 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-11 20:01:01,727 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-11 20:01:01,727 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-11 20:01:01,727 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-11 20:01:01,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L52-->L55: Formula: (and (= (+ v_~c~0_42 v_~counter~0_47) v_~counter~0_48) (not (= (ite (< 0 (mod v_~counter~0_48 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_48} OutVars{~counter~0=v_~counter~0_47, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][75], [24#L44true, 18#L55true, Black: 67#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 64#true, 91#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 66#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 75#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 95#true, Black: 74#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 73#(= thread1Thread1of1ForFork0_~i~0 0), 5#thread4EXITtrue, 38#L65true, Black: 81#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 28#L95true, Black: 86#(= thread1Thread1of1ForFork0_~i~0 0), Black: 56#(= ~counter~0 0), Black: 92#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 60#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 61#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296))]) [2024-10-11 20:01:01,728 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-11 20:01:01,728 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-11 20:01:01,728 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-11 20:01:01,728 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-11 20:01:01,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L52-->L55: Formula: (and (= (+ v_~c~0_42 v_~counter~0_47) v_~counter~0_48) (not (= (ite (< 0 (mod v_~counter~0_48 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_48} OutVars{~counter~0=v_~counter~0_47, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][75], [24#L44true, 18#L55true, Black: 64#true, Black: 66#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 91#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 75#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 95#true, Black: 74#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 73#(= thread1Thread1of1ForFork0_~i~0 0), 5#thread4EXITtrue, 38#L65true, Black: 81#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 28#L95true, Black: 86#(= thread1Thread1of1ForFork0_~i~0 0), 67#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 56#(= ~counter~0 0), Black: 60#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 92#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 61#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296))]) [2024-10-11 20:01:01,729 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-11 20:01:01,729 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-11 20:01:01,729 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-11 20:01:01,729 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-11 20:01:01,730 INFO L124 PetriNetUnfolderBase]: 34194/45997 cut-off events. [2024-10-11 20:01:01,730 INFO L125 PetriNetUnfolderBase]: For 152746/152760 co-relation queries the response was YES. [2024-10-11 20:01:02,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180920 conditions, 45997 events. 34194/45997 cut-off events. For 152746/152760 co-relation queries the response was YES. Maximal size of possible extension queue 1664. Compared 267330 event pairs, 10733 based on Foata normal form. 122/45153 useless extension candidates. Maximal degree in co-relation 60244. Up to 20569 conditions per place. [2024-10-11 20:01:02,290 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 135 selfloop transitions, 12 changer transitions 0/152 dead transitions. [2024-10-11 20:01:02,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 152 transitions, 1509 flow [2024-10-11 20:01:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:01:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 20:01:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-10-11 20:01:02,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2024-10-11 20:01:02,292 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 588 flow. Second operand 5 states and 128 transitions. [2024-10-11 20:01:02,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 152 transitions, 1509 flow [2024-10-11 20:01:02,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 152 transitions, 1488 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 20:01:02,328 INFO L231 Difference]: Finished difference. Result has 67 places, 76 transitions, 697 flow [2024-10-11 20:01:02,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=697, PETRI_PLACES=67, PETRI_TRANSITIONS=76} [2024-10-11 20:01:02,329 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-10-11 20:01:02,329 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 76 transitions, 697 flow [2024-10-11 20:01:02,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-10-11 20:01:02,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:01:02,330 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:01:02,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:01:02,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:01:02,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:01:02,331 INFO L85 PathProgramCache]: Analyzing trace with hash -52679837, now seen corresponding path program 4 times [2024-10-11 20:01:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:01:02,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614404235] [2024-10-11 20:01:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:01:02,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:01:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:01:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:01:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:01:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614404235] [2024-10-11 20:01:02,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614404235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:01:02,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:01:02,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:01:02,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204833531] [2024-10-11 20:01:02,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:01:02,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:01:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:01:02,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:01:02,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:01:02,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:01:02,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 76 transitions, 697 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:01:02,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:01:02,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:01:02,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:01:05,956 INFO L124 PetriNetUnfolderBase]: 40162/54071 cut-off events. [2024-10-11 20:01:05,956 INFO L125 PetriNetUnfolderBase]: For 241574/241766 co-relation queries the response was YES. [2024-10-11 20:01:06,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237635 conditions, 54071 events. 40162/54071 cut-off events. For 241574/241766 co-relation queries the response was YES. Maximal size of possible extension queue 2155. Compared 325331 event pairs, 8887 based on Foata normal form. 1074/53731 useless extension candidates. Maximal degree in co-relation 105632. Up to 33039 conditions per place. [2024-10-11 20:01:06,361 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 103 selfloop transitions, 14 changer transitions 2/124 dead transitions. [2024-10-11 20:01:06,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 1263 flow [2024-10-11 20:01:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:01:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 20:01:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-10-11 20:01:06,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-11 20:01:06,362 INFO L175 Difference]: Start difference. First operand has 67 places, 76 transitions, 697 flow. Second operand 4 states and 105 transitions. [2024-10-11 20:01:06,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 1263 flow [2024-10-11 20:01:06,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 124 transitions, 1222 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-10-11 20:01:06,842 INFO L231 Difference]: Finished difference. Result has 71 places, 77 transitions, 726 flow [2024-10-11 20:01:06,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=726, PETRI_PLACES=71, PETRI_TRANSITIONS=77} [2024-10-11 20:01:06,842 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2024-10-11 20:01:06,842 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 77 transitions, 726 flow [2024-10-11 20:01:06,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-11 20:01:06,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:01:06,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:01:06,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:01:06,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:01:06,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:01:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash 545427443, now seen corresponding path program 1 times [2024-10-11 20:01:06,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:01:06,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920294052] [2024-10-11 20:01:06,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:01:06,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:01:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:01:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:01:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:01:06,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920294052] [2024-10-11 20:01:06,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920294052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:01:06,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:01:06,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:01:06,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628973781] [2024-10-11 20:01:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:01:06,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:01:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:01:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:01:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:01:06,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:01:06,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 77 transitions, 726 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:01:06,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:01:06,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:01:06,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:01:11,830 INFO L124 PetriNetUnfolderBase]: 50700/68284 cut-off events. [2024-10-11 20:01:11,831 INFO L125 PetriNetUnfolderBase]: For 285088/285218 co-relation queries the response was YES. [2024-10-11 20:01:12,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287660 conditions, 68284 events. 50700/68284 cut-off events. For 285088/285218 co-relation queries the response was YES. Maximal size of possible extension queue 2550. Compared 416728 event pairs, 16438 based on Foata normal form. 230/67018 useless extension candidates. Maximal degree in co-relation 133042. Up to 34844 conditions per place. [2024-10-11 20:01:12,335 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 155 selfloop transitions, 19 changer transitions 1/180 dead transitions. [2024-10-11 20:01:12,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 180 transitions, 2075 flow [2024-10-11 20:01:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:01:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 20:01:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-10-11 20:01:12,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6047619047619047 [2024-10-11 20:01:12,336 INFO L175 Difference]: Start difference. First operand has 71 places, 77 transitions, 726 flow. Second operand 5 states and 127 transitions. [2024-10-11 20:01:12,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 180 transitions, 2075 flow [2024-10-11 20:01:12,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 180 transitions, 2026 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-10-11 20:01:12,439 INFO L231 Difference]: Finished difference. Result has 74 places, 88 transitions, 895 flow [2024-10-11 20:01:12,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=895, PETRI_PLACES=74, PETRI_TRANSITIONS=88} [2024-10-11 20:01:12,440 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2024-10-11 20:01:12,440 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 88 transitions, 895 flow [2024-10-11 20:01:12,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:01:12,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:01:12,440 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:01:12,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:01:12,440 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:01:12,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:01:12,441 INFO L85 PathProgramCache]: Analyzing trace with hash 9063571, now seen corresponding path program 2 times [2024-10-11 20:01:12,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:01:12,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427068322] [2024-10-11 20:01:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:01:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:01:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:01:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:01:12,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:01:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427068322] [2024-10-11 20:01:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427068322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:01:12,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:01:12,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:01:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453597535] [2024-10-11 20:01:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:01:12,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:01:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:01:12,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:01:12,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:01:12,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:01:12,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 88 transitions, 895 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:01:12,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:01:12,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:01:12,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:01:17,680 INFO L124 PetriNetUnfolderBase]: 51169/69187 cut-off events. [2024-10-11 20:01:17,680 INFO L125 PetriNetUnfolderBase]: For 400514/400679 co-relation queries the response was YES. [2024-10-11 20:01:17,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318223 conditions, 69187 events. 51169/69187 cut-off events. For 400514/400679 co-relation queries the response was YES. Maximal size of possible extension queue 2581. Compared 427807 event pairs, 17649 based on Foata normal form. 518/67980 useless extension candidates. Maximal degree in co-relation 96234. Up to 32929 conditions per place. [2024-10-11 20:01:18,579 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 131 selfloop transitions, 13 changer transitions 11/160 dead transitions. [2024-10-11 20:01:18,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 160 transitions, 1802 flow [2024-10-11 20:01:18,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:01:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 20:01:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-10-11 20:01:18,580 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-10-11 20:01:18,581 INFO L175 Difference]: Start difference. First operand has 74 places, 88 transitions, 895 flow. Second operand 5 states and 125 transitions. [2024-10-11 20:01:18,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 160 transitions, 1802 flow [2024-10-11 20:01:18,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 160 transitions, 1788 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-10-11 20:01:18,838 INFO L231 Difference]: Finished difference. Result has 80 places, 88 transitions, 952 flow [2024-10-11 20:01:18,838 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=952, PETRI_PLACES=80, PETRI_TRANSITIONS=88} [2024-10-11 20:01:18,839 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places. [2024-10-11 20:01:18,839 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 88 transitions, 952 flow [2024-10-11 20:01:18,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:01:18,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:01:18,840 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:01:18,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:01:18,840 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 20:01:18,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:01:18,841 INFO L85 PathProgramCache]: Analyzing trace with hash 641109189, now seen corresponding path program 3 times [2024-10-11 20:01:18,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:01:18,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844241383] [2024-10-11 20:01:18,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:01:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:01:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:01:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:01:18,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:01:18,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844241383] [2024-10-11 20:01:18,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844241383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:01:18,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:01:18,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:01:18,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247078787] [2024-10-11 20:01:18,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:01:18,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:01:18,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:01:18,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:01:18,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:01:18,965 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-10-11 20:01:18,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 88 transitions, 952 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:01:18,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:01:18,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-10-11 20:01:18,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand