./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75a7e23d8671ab9c707059b5300300854f7697b51bd2252b1df4e0c45e5bbfed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:21:47,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:21:47,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:21:47,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:21:47,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:21:47,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:21:47,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:21:47,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:21:47,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:21:47,620 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:21:47,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:21:47,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:21:47,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:21:47,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:21:47,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:21:47,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:21:47,623 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:21:47,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:21:47,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:21:47,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:21:47,625 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:21:47,628 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:21:47,628 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:21:47,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:21:47,629 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:21:47,629 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:21:47,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:21:47,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:21:47,630 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:21:47,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:21:47,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:21:47,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:21:47,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:21:47,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:21:47,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:21:47,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:21:47,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:21:47,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:21:47,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:21:47,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:21:47,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:21:47,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:21:47,634 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/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/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 -> 75a7e23d8671ab9c707059b5300300854f7697b51bd2252b1df4e0c45e5bbfed [2024-11-22 21:21:47,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:21:47,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:21:47,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:21:47,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:21:47,912 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:21:47,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2024-11-22 21:21:49,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:21:49,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:21:49,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2024-11-22 21:21:49,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e2a168d/95586c38cd9848d39ab039194695eee9/FLAG9b4c597d3 [2024-11-22 21:21:49,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e2a168d/95586c38cd9848d39ab039194695eee9 [2024-11-22 21:21:49,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:21:49,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:21:49,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:21:49,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:21:49,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:21:49,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:21:49" (1/1) ... [2024-11-22 21:21:49,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646cf72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:49, skipping insertion in model container [2024-11-22 21:21:49,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:21:49" (1/1) ... [2024-11-22 21:21:50,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:21:50,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:21:50,422 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:21:50,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:21:50,504 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:21:50,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50 WrapperNode [2024-11-22 21:21:50,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:21:50,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:21:50,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:21:50,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:21:50,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,559 INFO L138 Inliner]: procedures = 166, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2024-11-22 21:21:50,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:21:50,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:21:50,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:21:50,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:21:50,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,596 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2024-11-22 21:21:50,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:21:50,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:21:50,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:21:50,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:21:50,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (1/1) ... [2024-11-22 21:21:50,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:21:50,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:21:50,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:21:50,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:21:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-22 21:21:50,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-22 21:21:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-22 21:21:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:21:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:21:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:21:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 21:21:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:21:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-22 21:21:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:21:50,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:21:50,715 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:21:50,819 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:21:50,820 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:21:50,934 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:21:50,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:21:51,067 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:21:51,067 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 21:21:51,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:21:51 BoogieIcfgContainer [2024-11-22 21:21:51,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:21:51,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:21:51,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:21:51,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:21:51,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:21:49" (1/3) ... [2024-11-22 21:21:51,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a629796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:21:51, skipping insertion in model container [2024-11-22 21:21:51,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:50" (2/3) ... [2024-11-22 21:21:51,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a629796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:21:51, skipping insertion in model container [2024-11-22 21:21:51,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:21:51" (3/3) ... [2024-11-22 21:21:51,080 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2024-11-22 21:21:51,096 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:21:51,096 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 21:21:51,097 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:21:51,137 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:21:51,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 21 transitions, 46 flow [2024-11-22 21:21:51,194 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-11-22 21:21:51,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:21:51,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 2/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-11-22 21:21:51,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 21 transitions, 46 flow [2024-11-22 21:21:51,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 21 transitions, 46 flow [2024-11-22 21:21:51,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:21:51,218 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;@354021c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:21:51,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-22 21:21:51,223 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:21:51,225 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-22 21:21:51,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:21:51,226 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:21:51,226 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:21:51,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 21:21:51,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:21:51,232 INFO L85 PathProgramCache]: Analyzing trace with hash 227054, now seen corresponding path program 1 times [2024-11-22 21:21:51,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:21:51,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009441391] [2024-11-22 21:21:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:21:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:21:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:21:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:21:51,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:21:51,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009441391] [2024-11-22 21:21:51,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009441391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:21:51,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:21:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:21:51,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130560811] [2024-11-22 21:21:51,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:21:51,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 21:21:51,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:21:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 21:21:51,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 21:21:51,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-11-22 21:21:51,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 46 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-22 21:21:51,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:21:51,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-11-22 21:21:51,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:21:51,534 INFO L124 PetriNetUnfolderBase]: 21/61 cut-off events. [2024-11-22 21:21:51,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:21:51,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 61 events. 21/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 115 event pairs, 18 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 103. Up to 51 conditions per place. [2024-11-22 21:21:51,538 INFO L140 encePairwiseOnDemand]: 19/21 looper letters, 13 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2024-11-22 21:21:51,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 64 flow [2024-11-22 21:21:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 21:21:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-22 21:21:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2024-11-22 21:21:51,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-11-22 21:21:51,552 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 46 flow. Second operand 2 states and 25 transitions. [2024-11-22 21:21:51,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 64 flow [2024-11-22 21:21:51,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 64 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:21:51,556 INFO L231 Difference]: Finished difference. Result has 20 places, 17 transitions, 38 flow [2024-11-22 21:21:51,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=38, PETRI_PLACES=20, PETRI_TRANSITIONS=17} [2024-11-22 21:21:51,563 INFO L277 CegarLoopForPetriNet]: 22 programPoint places, -2 predicate places. [2024-11-22 21:21:51,563 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 38 flow [2024-11-22 21:21:51,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-22 21:21:51,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:21:51,564 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:21:51,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:21:51,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 21:21:51,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:21:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash 218197767, now seen corresponding path program 1 times [2024-11-22 21:21:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:21:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701676845] [2024-11-22 21:21:51,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:21:51,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:21:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:21:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:21:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:21:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701676845] [2024-11-22 21:21:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701676845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:21:51,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:21:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:21:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569596800] [2024-11-22 21:21:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:21:51,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:21:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:21:51,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:21:51,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:21:51,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-11-22 21:21:51,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11-22 21:21:51,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:21:51,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-11-22 21:21:51,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:21:51,793 INFO L124 PetriNetUnfolderBase]: 21/58 cut-off events. [2024-11-22 21:21:51,794 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:21:51,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 58 events. 21/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 12 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 110. Up to 35 conditions per place. [2024-11-22 21:21:51,796 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 13 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2024-11-22 21:21:51,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 18 transitions, 70 flow [2024-11-22 21:21:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:21:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:21:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2024-11-22 21:21:51,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-11-22 21:21:51,799 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 38 flow. Second operand 3 states and 28 transitions. [2024-11-22 21:21:51,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 18 transitions, 70 flow [2024-11-22 21:21:51,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 18 transitions, 70 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:21:51,801 INFO L231 Difference]: Finished difference. Result has 21 places, 16 transitions, 40 flow [2024-11-22 21:21:51,801 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=16} [2024-11-22 21:21:51,802 INFO L277 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2024-11-22 21:21:51,803 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 16 transitions, 40 flow [2024-11-22 21:21:51,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11-22 21:21:51,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:21:51,803 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-22 21:21:51,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:21:51,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 21:21:51,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:21:51,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1825818601, now seen corresponding path program 1 times [2024-11-22 21:21:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:21:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509181080] [2024-11-22 21:21:51,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:21:51,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:21:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:21:51,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:21:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:21:51,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:21:51,861 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:21:51,862 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-22 21:21:51,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-22 21:21:51,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-11-22 21:21:51,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2024-11-22 21:21:51,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:21:51,865 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-22 21:21:51,868 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-22 21:21:51,868 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-22 21:21:51,889 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:21:51,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 80 flow [2024-11-22 21:21:51,899 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2024-11-22 21:21:51,899 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-22 21:21:51,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 44 events. 4/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2024-11-22 21:21:51,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 35 transitions, 80 flow [2024-11-22 21:21:51,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 80 flow [2024-11-22 21:21:51,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:21:51,903 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;@354021c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:21:51,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-22 21:21:51,904 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:21:51,905 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-22 21:21:51,905 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:21:51,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:21:51,905 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:21:51,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 21:21:51,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:21:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 261809, now seen corresponding path program 1 times [2024-11-22 21:21:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:21:51,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524781218] [2024-11-22 21:21:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:21:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:21:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:21:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:21:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:21:51,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524781218] [2024-11-22 21:21:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524781218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:21:51,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:21:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:21:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453320374] [2024-11-22 21:21:51,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:21:51,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 21:21:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:21:51,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 21:21:51,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 21:21:51,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-22 21:21:51,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 80 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-11-22 21:21:51,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:21:51,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-22 21:21:51,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:21:52,120 INFO L124 PetriNetUnfolderBase]: 510/930 cut-off events. [2024-11-22 21:21:52,121 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-22 21:21:52,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 930 events. 510/930 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4090 event pairs, 468 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1108. Up to 801 conditions per place. [2024-11-22 21:21:52,132 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 23 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2024-11-22 21:21:52,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 116 flow [2024-11-22 21:21:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 21:21:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-22 21:21:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2024-11-22 21:21:52,134 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-22 21:21:52,134 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 80 flow. Second operand 2 states and 42 transitions. [2024-11-22 21:21:52,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 116 flow [2024-11-22 21:21:52,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:21:52,138 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 70 flow [2024-11-22 21:21:52,139 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2024-11-22 21:21:52,140 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2024-11-22 21:21:52,142 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 70 flow [2024-11-22 21:21:52,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-11-22 21:21:52,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:21:52,143 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:21:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:21:52,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 21:21:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:21:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash 251611351, now seen corresponding path program 1 times [2024-11-22 21:21:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:21:52,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132038800] [2024-11-22 21:21:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:21:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:21:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:21:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:21:52,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:21:52,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132038800] [2024-11-22 21:21:52,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132038800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:21:52,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:21:52,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:21:52,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184197349] [2024-11-22 21:21:52,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:21:52,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:21:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:21:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:21:52,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:21:52,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2024-11-22 21:21:52,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-22 21:21:52,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:21:52,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2024-11-22 21:21:52,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:21:52,413 INFO L124 PetriNetUnfolderBase]: 525/911 cut-off events. [2024-11-22 21:21:52,414 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-22 21:21:52,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 911 events. 525/911 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3650 event pairs, 252 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1785. Up to 451 conditions per place. [2024-11-22 21:21:52,422 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2024-11-22 21:21:52,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 193 flow [2024-11-22 21:21:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:21:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:21:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-11-22 21:21:52,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2024-11-22 21:21:52,424 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 70 flow. Second operand 3 states and 62 transitions. [2024-11-22 21:21:52,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 193 flow [2024-11-22 21:21:52,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:21:52,428 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 91 flow [2024-11-22 21:21:52,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2024-11-22 21:21:52,430 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2024-11-22 21:21:52,430 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 91 flow [2024-11-22 21:21:52,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-22 21:21:52,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:21:52,431 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-11-22 21:21:52,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:21:52,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 21:21:52,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:21:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1222877140, now seen corresponding path program 1 times [2024-11-22 21:21:52,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:21:52,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112436339] [2024-11-22 21:21:52,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:21:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:21:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:21:52,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:21:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:21:52,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:21:52,458 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:21:52,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-22 21:21:52,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-22 21:21:52,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2024-11-22 21:21:52,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2024-11-22 21:21:52,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-22 21:21:52,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:21:52,463 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-22 21:21:52,464 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-22 21:21:52,464 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-22 21:21:52,505 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:21:52,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 49 transitions, 116 flow [2024-11-22 21:21:52,515 INFO L124 PetriNetUnfolderBase]: 6/63 cut-off events. [2024-11-22 21:21:52,515 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-22 21:21:52,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 6/63 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 171 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 51. Up to 4 conditions per place. [2024-11-22 21:21:52,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 49 transitions, 116 flow [2024-11-22 21:21:52,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 49 transitions, 116 flow [2024-11-22 21:21:52,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:21:52,522 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;@354021c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:21:52,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-22 21:21:52,525 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:21:52,525 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-22 21:21:52,525 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:21:52,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:21:52,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:21:52,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-22 21:21:52,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:21:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash 310466, now seen corresponding path program 1 times [2024-11-22 21:21:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:21:52,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784013925] [2024-11-22 21:21:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:21:52,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:21:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:21:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:21:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:21:52,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784013925] [2024-11-22 21:21:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784013925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:21:52,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:21:52,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:21:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558379939] [2024-11-22 21:21:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:21:52,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 21:21:52,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:21:52,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 21:21:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 21:21:52,548 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2024-11-22 21:21:52,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-22 21:21:52,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:21:52,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2024-11-22 21:21:52,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:21:53,774 INFO L124 PetriNetUnfolderBase]: 8088/12296 cut-off events. [2024-11-22 21:21:53,776 INFO L125 PetriNetUnfolderBase]: For 724/724 co-relation queries the response was YES. [2024-11-22 21:21:53,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23733 conditions, 12296 events. 8088/12296 cut-off events. For 724/724 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 72157 event pairs, 7668 based on Foata normal form. 0/10800 useless extension candidates. Maximal degree in co-relation 2600. Up to 11001 conditions per place. [2024-11-22 21:21:53,891 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 33 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2024-11-22 21:21:53,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 170 flow [2024-11-22 21:21:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 21:21:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-22 21:21:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2024-11-22 21:21:53,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2024-11-22 21:21:53,894 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 116 flow. Second operand 2 states and 59 transitions. [2024-11-22 21:21:53,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 170 flow [2024-11-22 21:21:53,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 168 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-22 21:21:53,899 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 102 flow [2024-11-22 21:21:53,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-11-22 21:21:53,901 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-22 21:21:53,902 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 102 flow [2024-11-22 21:21:53,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-22 21:21:53,903 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:21:53,903 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:21:53,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:21:53,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-22 21:21:53,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:21:53,905 INFO L85 PathProgramCache]: Analyzing trace with hash 298384789, now seen corresponding path program 1 times [2024-11-22 21:21:53,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:21:53,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249778562] [2024-11-22 21:21:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:21:53,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:21:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:21:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:21:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:21:53,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249778562] [2024-11-22 21:21:53,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249778562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:21:53,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:21:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:21:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805655977] [2024-11-22 21:21:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:21:53,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:21:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:21:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:21:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:21:53,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 49 [2024-11-22 21:21:53,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11-22 21:21:53,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:21:53,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 49 [2024-11-22 21:21:53,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:21:55,024 INFO L124 PetriNetUnfolderBase]: 9048/13148 cut-off events. [2024-11-22 21:21:55,024 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2024-11-22 21:21:55,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26145 conditions, 13148 events. 9048/13148 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 70081 event pairs, 3549 based on Foata normal form. 0/12344 useless extension candidates. Maximal degree in co-relation 26139. Up to 8869 conditions per place. [2024-11-22 21:21:55,116 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 57 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2024-11-22 21:21:55,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 284 flow [2024-11-22 21:21:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:21:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:21:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-22 21:21:55,119 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2024-11-22 21:21:55,119 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 102 flow. Second operand 3 states and 88 transitions. [2024-11-22 21:21:55,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 284 flow [2024-11-22 21:21:55,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 284 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:21:55,123 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 132 flow [2024-11-22 21:21:55,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2024-11-22 21:21:55,124 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2024-11-22 21:21:55,124 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 132 flow [2024-11-22 21:21:55,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11-22 21:21:55,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:21:55,125 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2024-11-22 21:21:55,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:21:55,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-22 21:21:55,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:21:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1126466602, now seen corresponding path program 1 times [2024-11-22 21:21:55,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:21:55,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471351491] [2024-11-22 21:21:55,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:21:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:21:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:21:55,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:21:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:21:55,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:21:55,156 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:21:55,156 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-22 21:21:55,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-22 21:21:55,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-22 21:21:55,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2024-11-22 21:21:55,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-11-22 21:21:55,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-22 21:21:55,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:21:55,158 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-22 21:21:55,159 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-22 21:21:55,159 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-22 21:21:55,203 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:21:55,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 63 transitions, 154 flow [2024-11-22 21:21:55,214 INFO L124 PetriNetUnfolderBase]: 8/82 cut-off events. [2024-11-22 21:21:55,214 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-22 21:21:55,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 82 events. 8/82 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 246 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 75. Up to 5 conditions per place. [2024-11-22 21:21:55,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 63 transitions, 154 flow [2024-11-22 21:21:55,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 63 transitions, 154 flow [2024-11-22 21:21:55,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:21:55,218 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;@354021c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:21:55,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 21:21:55,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:21:55,219 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-22 21:21:55,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:21:55,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:21:55,220 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:21:55,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 21:21:55,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:21:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 373025, now seen corresponding path program 1 times [2024-11-22 21:21:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:21:55,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403236620] [2024-11-22 21:21:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:21:55,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:21:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:21:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:21:55,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:21:55,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403236620] [2024-11-22 21:21:55,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403236620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:21:55,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:21:55,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:21:55,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069671312] [2024-11-22 21:21:55,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:21:55,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 21:21:55,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:21:55,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 21:21:55,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 21:21:55,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 63 [2024-11-22 21:21:55,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 154 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-22 21:21:55,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:21:55,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 63 [2024-11-22 21:21:55,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:22:06,107 INFO L124 PetriNetUnfolderBase]: 110868/152924 cut-off events. [2024-11-22 21:22:06,108 INFO L125 PetriNetUnfolderBase]: For 12416/12416 co-relation queries the response was YES. [2024-11-22 21:22:06,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298362 conditions, 152924 events. 110868/152924 cut-off events. For 12416/12416 co-relation queries the response was YES. Maximal size of possible extension queue 3414. Compared 1036013 event pairs, 106668 based on Foata normal form. 0/134616 useless extension candidates. Maximal degree in co-relation 23839. Up to 140001 conditions per place. [2024-11-22 21:22:07,496 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 43 selfloop transitions, 0 changer transitions 0/56 dead transitions. [2024-11-22 21:22:07,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 226 flow [2024-11-22 21:22:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 21:22:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-22 21:22:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2024-11-22 21:22:07,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2024-11-22 21:22:07,500 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 154 flow. Second operand 2 states and 76 transitions. [2024-11-22 21:22:07,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 56 transitions, 226 flow [2024-11-22 21:22:07,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 220 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-22 21:22:07,514 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 134 flow [2024-11-22 21:22:07,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-11-22 21:22:07,515 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2024-11-22 21:22:07,515 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 134 flow [2024-11-22 21:22:07,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-22 21:22:07,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:22:07,516 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:22:07,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:22:07,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 21:22:07,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:22:07,519 INFO L85 PathProgramCache]: Analyzing trace with hash 358518913, now seen corresponding path program 1 times [2024-11-22 21:22:07,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:22:07,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382265876] [2024-11-22 21:22:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:22:07,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:22:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:22:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:22:07,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:22:07,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382265876] [2024-11-22 21:22:07,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382265876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:22:07,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:22:07,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:22:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905066484] [2024-11-22 21:22:07,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:22:07,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:22:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:22:07,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:22:07,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:22:07,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2024-11-22 21:22:07,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-11-22 21:22:07,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:22:07,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2024-11-22 21:22:07,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:22:18,259 INFO L124 PetriNetUnfolderBase]: 138114/182648 cut-off events. [2024-11-22 21:22:18,259 INFO L125 PetriNetUnfolderBase]: For 4666/4666 co-relation queries the response was YES. [2024-11-22 21:22:18,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365566 conditions, 182648 events. 138114/182648 cut-off events. For 4666/4666 co-relation queries the response was YES. Maximal size of possible extension queue 3636. Compared 1116555 event pairs, 45867 based on Foata normal form. 0/170309 useless extension candidates. Maximal degree in co-relation 365559. Up to 145462 conditions per place. [2024-11-22 21:22:19,257 INFO L140 encePairwiseOnDemand]: 54/63 looper letters, 75 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-11-22 21:22:19,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 375 flow [2024-11-22 21:22:19,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:22:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:22:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-22 21:22:19,259 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2024-11-22 21:22:19,259 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 134 flow. Second operand 3 states and 114 transitions. [2024-11-22 21:22:19,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 375 flow [2024-11-22 21:22:19,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:22:19,271 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 173 flow [2024-11-22 21:22:19,272 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-11-22 21:22:19,272 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2024-11-22 21:22:19,272 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 173 flow [2024-11-22 21:22:19,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-11-22 21:22:19,273 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:22:19,273 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2024-11-22 21:22:19,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:22:19,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 21:22:19,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:22:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1251239933, now seen corresponding path program 1 times [2024-11-22 21:22:19,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:22:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996866055] [2024-11-22 21:22:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:22:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:22:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:22:19,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:22:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:22:19,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:22:19,300 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:22:19,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-22 21:22:19,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-22 21:22:19,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-22 21:22:19,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-22 21:22:19,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-22 21:22:19,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-22 21:22:19,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-22 21:22:19,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:22:19,302 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-22 21:22:19,303 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-22 21:22:19,303 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-22 21:22:19,345 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:22:19,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 194 flow [2024-11-22 21:22:19,356 INFO L124 PetriNetUnfolderBase]: 10/101 cut-off events. [2024-11-22 21:22:19,356 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-22 21:22:19,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 101 events. 10/101 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 309 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 100. Up to 6 conditions per place. [2024-11-22 21:22:19,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 194 flow [2024-11-22 21:22:19,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 77 transitions, 194 flow [2024-11-22 21:22:19,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:22:19,361 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;@354021c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:22:19,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-22 21:22:19,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:22:19,362 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-22 21:22:19,362 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:22:19,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:22:19,363 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:22:19,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-22 21:22:19,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:22:19,363 INFO L85 PathProgramCache]: Analyzing trace with hash 449486, now seen corresponding path program 1 times [2024-11-22 21:22:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:22:19,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462342100] [2024-11-22 21:22:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:22:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:22:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:22:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:22:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:22:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462342100] [2024-11-22 21:22:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462342100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:22:19,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:22:19,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:22:19,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797132714] [2024-11-22 21:22:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:22:19,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 21:22:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:22:19,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 21:22:19,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 21:22:19,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 77 [2024-11-22 21:22:19,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-22 21:22:19,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:22:19,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 77 [2024-11-22 21:22:19,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand