./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:29:37,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:29:37,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:29:37,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:29:37,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:29:37,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:29:37,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:29:37,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:29:37,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:29:37,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:29:37,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:29:37,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:29:37,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:29:37,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:29:37,621 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:29:37,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:29:37,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:29:37,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:29:37,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:29:37,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:29:37,623 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:29:37,624 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:29:37,624 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:29:37,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:29:37,625 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:29:37,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:29:37,626 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:29:37,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:29:37,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:29:37,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:29:37,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:29:37,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:29:37,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:29:37,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:29:37,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:29:37,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:29:37,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:29:37,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:29:37,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:29:37,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:29:37,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:29:37,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:29:37,631 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 [2024-10-11 19:29:37,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:29:37,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:29:37,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:29:37,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:29:37,915 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:29:37,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2024-10-11 19:29:39,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:29:39,690 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:29:39,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2024-10-11 19:29:39,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5aac40d6d/d7186452aa0f43668f1396d79da278a8/FLAG0fca4f128 [2024-10-11 19:29:39,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5aac40d6d/d7186452aa0f43668f1396d79da278a8 [2024-10-11 19:29:39,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:29:39,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:29:39,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:29:39,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:29:39,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:29:39,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:29:39" (1/1) ... [2024-10-11 19:29:39,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788c819b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:39, skipping insertion in model container [2024-10-11 19:29:39,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:29:39" (1/1) ... [2024-10-11 19:29:39,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:29:40,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:29:40,138 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:29:40,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:29:40,224 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:29:40,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40 WrapperNode [2024-10-11 19:29:40,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:29:40,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:29:40,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:29:40,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:29:40,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,266 INFO L138 Inliner]: procedures = 168, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2024-10-11 19:29:40,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:29:40,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:29:40,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:29:40,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:29:40,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,295 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 19:29:40,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:29:40,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:29:40,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:29:40,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:29:40,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (1/1) ... [2024-10-11 19:29:40,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:29:40,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:29:40,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:29:40,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:29:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-11 19:29:40,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-11 19:29:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:29:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:29:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:29:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:29:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:29:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:29:40,407 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:29:40,565 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:29:40,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:29:40,682 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:29:40,683 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:29:40,768 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:29:40,769 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 19:29:40,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:29:40 BoogieIcfgContainer [2024-10-11 19:29:40,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:29:40,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:29:40,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:29:40,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:29:40,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:29:39" (1/3) ... [2024-10-11 19:29:40,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c8c095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:29:40, skipping insertion in model container [2024-10-11 19:29:40,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:40" (2/3) ... [2024-10-11 19:29:40,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c8c095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:29:40, skipping insertion in model container [2024-10-11 19:29:40,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:29:40" (3/3) ... [2024-10-11 19:29:40,781 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2024-10-11 19:29:40,799 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:29:40,801 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 19:29:40,801 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:29:40,838 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:29:40,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 13 transitions, 30 flow [2024-10-11 19:29:40,899 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-10-11 19:29:40,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:29:40,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-10-11 19:29:40,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 16 places, 13 transitions, 30 flow [2024-10-11 19:29:40,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 16 places, 13 transitions, 30 flow [2024-10-11 19:29:40,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:29:40,923 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;@427f142, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:29:40,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 19:29:40,928 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:29:40,928 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-11 19:29:40,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:29:40,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:40,929 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:29:40,930 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-10-11 19:29:40,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash 129896, now seen corresponding path program 1 times [2024-10-11 19:29:40,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:40,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612938329] [2024-10-11 19:29:40,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:40,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:41,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612938329] [2024-10-11 19:29:41,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612938329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:41,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:41,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:29:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916854550] [2024-10-11 19:29:41,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:41,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 19:29:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:41,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 19:29:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 19:29:41,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 13 [2024-10-11 19:29:41,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 13 transitions, 30 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-10-11 19:29:41,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:41,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 13 [2024-10-11 19:29:41,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:41,250 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-10-11 19:29:41,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:29:41,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 20 events. 3/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 28 event pairs, 3 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 23. Up to 14 conditions per place. [2024-10-11 19:29:41,254 INFO L140 encePairwiseOnDemand]: 12/13 looper letters, 6 selfloop transitions, 0 changer transitions 0/10 dead transitions. [2024-10-11 19:29:41,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 10 transitions, 36 flow [2024-10-11 19:29:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 19:29:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 19:29:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 17 transitions. [2024-10-11 19:29:41,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2024-10-11 19:29:41,269 INFO L175 Difference]: Start difference. First operand has 16 places, 13 transitions, 30 flow. Second operand 2 states and 17 transitions. [2024-10-11 19:29:41,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 10 transitions, 36 flow [2024-10-11 19:29:41,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 10 transitions, 36 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:29:41,275 INFO L231 Difference]: Finished difference. Result has 14 places, 10 transitions, 24 flow [2024-10-11 19:29:41,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=24, PETRI_PLACES=14, PETRI_TRANSITIONS=10} [2024-10-11 19:29:41,283 INFO L277 CegarLoopForPetriNet]: 16 programPoint places, -2 predicate places. [2024-10-11 19:29:41,283 INFO L471 AbstractCegarLoop]: Abstraction has has 14 places, 10 transitions, 24 flow [2024-10-11 19:29:41,283 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-10-11 19:29:41,284 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:41,284 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-10-11 19:29:41,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:29:41,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 19:29:41,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash 124814821, now seen corresponding path program 1 times [2024-10-11 19:29:41,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:41,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755550751] [2024-10-11 19:29:41,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:41,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:29:41,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:29:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:29:41,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:29:41,347 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:29:41,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-11 19:29:41,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-10-11 19:29:41,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-10-11 19:29:41,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2024-10-11 19:29:41,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:29:41,352 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 19:29:41,354 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 19:29:41,354 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 19:29:41,369 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:29:41,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 50 flow [2024-10-11 19:29:41,378 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-11 19:29:41,378 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:29:41,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 28 events. 0/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 71 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-10-11 19:29:41,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 20 transitions, 50 flow [2024-10-11 19:29:41,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 50 flow [2024-10-11 19:29:41,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:29:41,381 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;@427f142, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:29:41,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 19:29:41,383 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:29:41,385 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-11 19:29:41,385 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:29:41,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:41,385 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:29:41,385 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-10-11 19:29:41,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash 149756, now seen corresponding path program 1 times [2024-10-11 19:29:41,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331073381] [2024-10-11 19:29:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331073381] [2024-10-11 19:29:41,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331073381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:41,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:41,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:29:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862537380] [2024-10-11 19:29:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:41,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 19:29:41,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:41,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 19:29:41,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 19:29:41,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 20 [2024-10-11 19:29:41,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 50 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-10-11 19:29:41,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:41,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 20 [2024-10-11 19:29:41,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:41,480 INFO L124 PetriNetUnfolderBase]: 39/112 cut-off events. [2024-10-11 19:29:41,484 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 19:29:41,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 112 events. 39/112 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 524 event pairs, 39 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 56. Up to 82 conditions per place. [2024-10-11 19:29:41,487 INFO L140 encePairwiseOnDemand]: 19/20 looper letters, 10 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2024-10-11 19:29:41,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 64 flow [2024-10-11 19:29:41,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 19:29:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 19:29:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2024-10-11 19:29:41,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-10-11 19:29:41,491 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 50 flow. Second operand 2 states and 27 transitions. [2024-10-11 19:29:41,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 64 flow [2024-10-11 19:29:41,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 64 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:29:41,493 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 44 flow [2024-10-11 19:29:41,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, 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=44, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2024-10-11 19:29:41,495 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-10-11 19:29:41,495 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 44 flow [2024-10-11 19:29:41,495 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-10-11 19:29:41,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:41,496 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:29:41,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:29:41,496 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-10-11 19:29:41,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:41,497 INFO L85 PathProgramCache]: Analyzing trace with hash 143907184, now seen corresponding path program 1 times [2024-10-11 19:29:41,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:41,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778694103] [2024-10-11 19:29:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:41,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:41,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:41,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778694103] [2024-10-11 19:29:41,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778694103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:41,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:41,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:29:41,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011630657] [2024-10-11 19:29:41,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:41,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:29:41,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:41,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:29:41,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:29:41,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2024-10-11 19:29:41,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:41,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:41,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2024-10-11 19:29:41,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:41,683 INFO L124 PetriNetUnfolderBase]: 47/107 cut-off events. [2024-10-11 19:29:41,683 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-11 19:29:41,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 107 events. 47/107 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 365 event pairs, 15 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 218. Up to 77 conditions per place. [2024-10-11 19:29:41,687 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 15 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2024-10-11 19:29:41,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 97 flow [2024-10-11 19:29:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:29:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:29:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2024-10-11 19:29:41,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-10-11 19:29:41,689 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 44 flow. Second operand 3 states and 38 transitions. [2024-10-11 19:29:41,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 97 flow [2024-10-11 19:29:41,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 97 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:29:41,692 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 65 flow [2024-10-11 19:29:41,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2024-10-11 19:29:41,694 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2024-10-11 19:29:41,694 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 65 flow [2024-10-11 19:29:41,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:41,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:41,695 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2024-10-11 19:29:41,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:29:41,695 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-10-11 19:29:41,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash 855384093, now seen corresponding path program 1 times [2024-10-11 19:29:41,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:41,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097242606] [2024-10-11 19:29:41,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:29:41,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:29:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:29:41,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:29:41,737 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:29:41,738 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-11 19:29:41,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-10-11 19:29:41,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2024-10-11 19:29:41,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2024-10-11 19:29:41,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-10-11 19:29:41,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:29:41,739 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 19:29:41,740 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 19:29:41,740 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 19:29:41,762 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:29:41,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 72 flow [2024-10-11 19:29:41,776 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-10-11 19:29:41,776 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 19:29:41,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 0/39 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-10-11 19:29:41,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 27 transitions, 72 flow [2024-10-11 19:29:41,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 27 transitions, 72 flow [2024-10-11 19:29:41,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:29:41,784 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;@427f142, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:29:41,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 19:29:41,785 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:29:41,786 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-11 19:29:41,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:29:41,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:41,787 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:29:41,788 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-10-11 19:29:41,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash 176567, now seen corresponding path program 1 times [2024-10-11 19:29:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:41,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365715626] [2024-10-11 19:29:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:41,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:41,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365715626] [2024-10-11 19:29:41,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365715626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:41,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:41,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:29:41,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023918663] [2024-10-11 19:29:41,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:41,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 19:29:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:41,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 19:29:41,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 19:29:41,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 27 [2024-10-11 19:29:41,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 72 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-10-11 19:29:41,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:41,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 27 [2024-10-11 19:29:41,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:41,969 INFO L124 PetriNetUnfolderBase]: 279/576 cut-off events. [2024-10-11 19:29:41,970 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-10-11 19:29:41,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 576 events. 279/576 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3605 event pairs, 279 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 210. Up to 450 conditions per place. [2024-10-11 19:29:41,977 INFO L140 encePairwiseOnDemand]: 26/27 looper letters, 14 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2024-10-11 19:29:41,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 24 transitions, 94 flow [2024-10-11 19:29:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 19:29:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 19:29:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2024-10-11 19:29:41,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-10-11 19:29:41,980 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 72 flow. Second operand 2 states and 37 transitions. [2024-10-11 19:29:41,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 24 transitions, 94 flow [2024-10-11 19:29:41,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 19:29:41,986 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 64 flow [2024-10-11 19:29:41,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2024-10-11 19:29:41,987 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2024-10-11 19:29:41,987 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 64 flow [2024-10-11 19:29:41,987 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-10-11 19:29:41,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:41,988 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:29:41,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:29:41,988 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-10-11 19:29:41,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash 169679185, now seen corresponding path program 1 times [2024-10-11 19:29:41,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722327235] [2024-10-11 19:29:41,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:42,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:42,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722327235] [2024-10-11 19:29:42,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722327235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:42,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:42,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:29:42,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470072468] [2024-10-11 19:29:42,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:42,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:29:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:42,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:29:42,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:29:42,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-10-11 19:29:42,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:42,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:42,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-10-11 19:29:42,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:42,238 INFO L124 PetriNetUnfolderBase]: 447/731 cut-off events. [2024-10-11 19:29:42,238 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-10-11 19:29:42,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 731 events. 447/731 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3400 event pairs, 161 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 1514. Up to 653 conditions per place. [2024-10-11 19:29:42,249 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 22 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2024-10-11 19:29:42,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 144 flow [2024-10-11 19:29:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:29:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:29:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-10-11 19:29:42,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-10-11 19:29:42,253 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 64 flow. Second operand 3 states and 53 transitions. [2024-10-11 19:29:42,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 144 flow [2024-10-11 19:29:42,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:29:42,254 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 94 flow [2024-10-11 19:29:42,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-10-11 19:29:42,257 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2024-10-11 19:29:42,257 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 94 flow [2024-10-11 19:29:42,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:42,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:42,258 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-10-11 19:29:42,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 19:29:42,258 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-10-11 19:29:42,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash -32874455, now seen corresponding path program 1 times [2024-10-11 19:29:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:42,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463869420] [2024-10-11 19:29:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:29:42,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:29:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:29:42,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:29:42,306 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:29:42,306 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-11 19:29:42,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-11 19:29:42,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-11 19:29:42,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2024-10-11 19:29:42,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-10-11 19:29:42,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-11 19:29:42,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:29:42,309 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 19:29:42,310 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 19:29:42,310 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-11 19:29:42,337 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:29:42,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 96 flow [2024-10-11 19:29:42,344 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2024-10-11 19:29:42,344 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 19:29:42,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 50 events. 0/50 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-10-11 19:29:42,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 34 transitions, 96 flow [2024-10-11 19:29:42,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 34 transitions, 96 flow [2024-10-11 19:29:42,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:29:42,348 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;@427f142, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:29:42,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 19:29:42,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:29:42,352 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-11 19:29:42,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:29:42,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:42,352 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:29:42,353 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-10-11 19:29:42,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:42,354 INFO L85 PathProgramCache]: Analyzing trace with hash 210329, now seen corresponding path program 1 times [2024-10-11 19:29:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:42,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937392776] [2024-10-11 19:29:42,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:42,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:42,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937392776] [2024-10-11 19:29:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937392776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:42,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:42,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:29:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012493429] [2024-10-11 19:29:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:42,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 19:29:42,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:42,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 19:29:42,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 19:29:42,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-10-11 19:29:42,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 96 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-10-11 19:29:42,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:42,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-10-11 19:29:42,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:42,709 INFO L124 PetriNetUnfolderBase]: 1623/2816 cut-off events. [2024-10-11 19:29:42,709 INFO L125 PetriNetUnfolderBase]: For 1972/1972 co-relation queries the response was YES. [2024-10-11 19:29:42,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5525 conditions, 2816 events. 1623/2816 cut-off events. For 1972/1972 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 20147 event pairs, 1623 based on Foata normal form. 0/1999 useless extension candidates. Maximal degree in co-relation 1122. Up to 2306 conditions per place. [2024-10-11 19:29:42,738 INFO L140 encePairwiseOnDemand]: 33/34 looper letters, 18 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2024-10-11 19:29:42,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 126 flow [2024-10-11 19:29:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 19:29:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 19:29:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2024-10-11 19:29:42,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-10-11 19:29:42,743 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 96 flow. Second operand 2 states and 47 transitions. [2024-10-11 19:29:42,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 126 flow [2024-10-11 19:29:42,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 120 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-11 19:29:42,747 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 84 flow [2024-10-11 19:29:42,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-10-11 19:29:42,751 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-10-11 19:29:42,751 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 84 flow [2024-10-11 19:29:42,751 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-10-11 19:29:42,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:42,751 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:29:42,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:29:42,752 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-10-11 19:29:42,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:42,752 INFO L85 PathProgramCache]: Analyzing trace with hash 202131513, now seen corresponding path program 1 times [2024-10-11 19:29:42,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:42,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626880456] [2024-10-11 19:29:42,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:42,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:42,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:42,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626880456] [2024-10-11 19:29:42,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626880456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:42,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:42,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:29:42,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609252747] [2024-10-11 19:29:42,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:42,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:29:42,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:42,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:29:42,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:29:42,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-10-11 19:29:42,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:42,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:42,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-10-11 19:29:42,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:43,233 INFO L124 PetriNetUnfolderBase]: 3473/4901 cut-off events. [2024-10-11 19:29:43,234 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2024-10-11 19:29:43,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10155 conditions, 4901 events. 3473/4901 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25182 event pairs, 1433 based on Foata normal form. 0/3983 useless extension candidates. Maximal degree in co-relation 10148. Up to 4711 conditions per place. [2024-10-11 19:29:43,282 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 29 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2024-10-11 19:29:43,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 191 flow [2024-10-11 19:29:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:29:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:29:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-10-11 19:29:43,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-11 19:29:43,287 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 84 flow. Second operand 3 states and 68 transitions. [2024-10-11 19:29:43,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 191 flow [2024-10-11 19:29:43,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 191 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:29:43,290 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 123 flow [2024-10-11 19:29:43,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-10-11 19:29:43,292 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-10-11 19:29:43,292 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 123 flow [2024-10-11 19:29:43,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:43,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:43,293 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-10-11 19:29:43,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 19:29:43,295 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-10-11 19:29:43,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:43,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1408167593, now seen corresponding path program 1 times [2024-10-11 19:29:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005209722] [2024-10-11 19:29:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:29:43,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:29:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:29:43,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:29:43,327 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:29:43,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-11 19:29:43,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-11 19:29:43,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-11 19:29:43,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-10-11 19:29:43,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-10-11 19:29:43,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-10-11 19:29:43,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-11 19:29:43,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 19:29:43,329 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 19:29:43,329 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 19:29:43,329 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-11 19:29:43,359 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:29:43,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 122 flow [2024-10-11 19:29:43,370 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2024-10-11 19:29:43,370 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-11 19:29:43,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 61 events. 0/61 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 181 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2024-10-11 19:29:43,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 41 transitions, 122 flow [2024-10-11 19:29:43,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 41 transitions, 122 flow [2024-10-11 19:29:43,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:29:43,373 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;@427f142, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:29:43,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 19:29:43,374 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:29:43,374 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-11 19:29:43,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:29:43,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:43,374 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:29:43,374 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-10-11 19:29:43,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash 251042, now seen corresponding path program 1 times [2024-10-11 19:29:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497235928] [2024-10-11 19:29:43,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:43,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:43,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497235928] [2024-10-11 19:29:43,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497235928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:43,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:43,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:29:43,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28034662] [2024-10-11 19:29:43,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:43,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 19:29:43,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:43,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 19:29:43,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 19:29:43,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-10-11 19:29:43,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 122 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-10-11 19:29:43,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:43,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-10-11 19:29:43,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:44,626 INFO L124 PetriNetUnfolderBase]: 8535/13312 cut-off events. [2024-10-11 19:29:44,627 INFO L125 PetriNetUnfolderBase]: For 13236/13236 co-relation queries the response was YES. [2024-10-11 19:29:44,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26518 conditions, 13312 events. 8535/13312 cut-off events. For 13236/13236 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 103360 event pairs, 8535 based on Foata normal form. 0/9359 useless extension candidates. Maximal degree in co-relation 5602. Up to 11266 conditions per place. [2024-10-11 19:29:44,826 INFO L140 encePairwiseOnDemand]: 40/41 looper letters, 22 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-10-11 19:29:44,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 160 flow [2024-10-11 19:29:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 19:29:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 19:29:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2024-10-11 19:29:44,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6951219512195121 [2024-10-11 19:29:44,830 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 122 flow. Second operand 2 states and 57 transitions. [2024-10-11 19:29:44,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 160 flow [2024-10-11 19:29:44,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 148 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-10-11 19:29:44,844 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 104 flow [2024-10-11 19:29:44,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-10-11 19:29:44,847 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-10-11 19:29:44,848 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 104 flow [2024-10-11 19:29:44,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-10-11 19:29:44,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:44,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:29:44,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 19:29:44,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:29:44,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash 241263592, now seen corresponding path program 1 times [2024-10-11 19:29:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:44,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482044627] [2024-10-11 19:29:44,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:44,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:44,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482044627] [2024-10-11 19:29:44,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482044627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:44,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:44,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:29:44,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681172851] [2024-10-11 19:29:44,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:44,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:29:44,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:44,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:29:44,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:29:44,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-10-11 19:29:44,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:44,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:44,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-10-11 19:29:44,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:47,431 INFO L124 PetriNetUnfolderBase]: 24009/31313 cut-off events. [2024-10-11 19:29:47,432 INFO L125 PetriNetUnfolderBase]: For 2330/2330 co-relation queries the response was YES. [2024-10-11 19:29:47,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64612 conditions, 31313 events. 24009/31313 cut-off events. For 2330/2330 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 169658 event pairs, 11031 based on Foata normal form. 0/24923 useless extension candidates. Maximal degree in co-relation 64604. Up to 30867 conditions per place. [2024-10-11 19:29:47,846 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 36 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-10-11 19:29:47,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 238 flow [2024-10-11 19:29:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:29:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:29:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-10-11 19:29:47,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6747967479674797 [2024-10-11 19:29:47,849 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 104 flow. Second operand 3 states and 83 transitions. [2024-10-11 19:29:47,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 238 flow [2024-10-11 19:29:47,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 238 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:29:47,854 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 152 flow [2024-10-11 19:29:47,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-10-11 19:29:47,855 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-10-11 19:29:47,855 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 152 flow [2024-10-11 19:29:47,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:47,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:47,856 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:29:47,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 19:29:47,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:29:47,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:47,857 INFO L85 PathProgramCache]: Analyzing trace with hash -847865375, now seen corresponding path program 1 times [2024-10-11 19:29:47,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:47,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790335731] [2024-10-11 19:29:47,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:47,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:47,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790335731] [2024-10-11 19:29:47,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790335731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:47,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:29:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087393881] [2024-10-11 19:29:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:47,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:29:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:29:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:29:47,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-10-11 19:29:47,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:47,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:47,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-10-11 19:29:47,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:49,481 INFO L124 PetriNetUnfolderBase]: 13439/19846 cut-off events. [2024-10-11 19:29:49,481 INFO L125 PetriNetUnfolderBase]: For 7894/7894 co-relation queries the response was YES. [2024-10-11 19:29:49,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41510 conditions, 19846 events. 13439/19846 cut-off events. For 7894/7894 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 135125 event pairs, 5255 based on Foata normal form. 5668/24391 useless extension candidates. Maximal degree in co-relation 41500. Up to 15240 conditions per place. [2024-10-11 19:29:49,615 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 32 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-10-11 19:29:49,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 256 flow [2024-10-11 19:29:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:29:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:29:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-10-11 19:29:49,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2024-10-11 19:29:49,617 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 152 flow. Second operand 3 states and 78 transitions. [2024-10-11 19:29:49,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 256 flow [2024-10-11 19:29:49,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:29:49,623 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 161 flow [2024-10-11 19:29:49,623 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-10-11 19:29:49,623 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-10-11 19:29:49,624 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 161 flow [2024-10-11 19:29:49,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:49,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:49,624 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:29:49,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 19:29:49,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:29:49,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash -761048003, now seen corresponding path program 1 times [2024-10-11 19:29:49,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:49,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728266947] [2024-10-11 19:29:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:49,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:29:49,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:29:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:29:49,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:29:49,659 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:29:49,659 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-10-11 19:29:49,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-11 19:29:49,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-11 19:29:49,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2024-10-11 19:29:49,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2024-10-11 19:29:49,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2024-10-11 19:29:49,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2024-10-11 19:29:49,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-11 19:29:49,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 19:29:49,661 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 19:29:49,661 WARN L239 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 19:29:49,661 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-10-11 19:29:49,686 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:29:49,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 48 transitions, 150 flow [2024-10-11 19:29:49,692 INFO L124 PetriNetUnfolderBase]: 0/72 cut-off events. [2024-10-11 19:29:49,692 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-10-11 19:29:49,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 72 events. 0/72 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 216 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2024-10-11 19:29:49,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 48 transitions, 150 flow [2024-10-11 19:29:49,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 48 transitions, 150 flow [2024-10-11 19:29:49,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:29:49,695 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;@427f142, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:29:49,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-11 19:29:49,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:29:49,696 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-11 19:29:49,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:29:49,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:49,696 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:29:49,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-11 19:29:49,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash 298706, now seen corresponding path program 1 times [2024-10-11 19:29:49,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:49,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745353919] [2024-10-11 19:29:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:49,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:49,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745353919] [2024-10-11 19:29:49,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745353919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:49,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:49,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:29:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645499470] [2024-10-11 19:29:49,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:49,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 19:29:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:49,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 19:29:49,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 19:29:49,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-10-11 19:29:49,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 150 flow. Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:49,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:49,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-10-11 19:29:49,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:29:53,905 INFO L124 PetriNetUnfolderBase]: 42327/61440 cut-off events. [2024-10-11 19:29:53,905 INFO L125 PetriNetUnfolderBase]: For 79796/79796 co-relation queries the response was YES. [2024-10-11 19:29:54,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123799 conditions, 61440 events. 42327/61440 cut-off events. For 79796/79796 co-relation queries the response was YES. Maximal size of possible extension queue 3378. Compared 499517 event pairs, 42327 based on Foata normal form. 0/42895 useless extension candidates. Maximal degree in co-relation 26850. Up to 53250 conditions per place. [2024-10-11 19:29:54,380 INFO L140 encePairwiseOnDemand]: 47/48 looper letters, 26 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2024-10-11 19:29:54,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 196 flow [2024-10-11 19:29:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 19:29:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 19:29:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2024-10-11 19:29:54,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2024-10-11 19:29:54,382 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 150 flow. Second operand 2 states and 67 transitions. [2024-10-11 19:29:54,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 196 flow [2024-10-11 19:29:54,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 45 transitions, 176 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-10-11 19:29:54,445 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 124 flow [2024-10-11 19:29:54,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2024-10-11 19:29:54,446 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2024-10-11 19:29:54,446 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 124 flow [2024-10-11 19:29:54,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:54,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:29:54,446 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:29:54,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 19:29:54,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-11 19:29:54,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:29:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash 287075998, now seen corresponding path program 1 times [2024-10-11 19:29:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:29:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977877435] [2024-10-11 19:29:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:29:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:29:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:29:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:29:54,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:29:54,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977877435] [2024-10-11 19:29:54,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977877435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:29:54,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:29:54,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:29:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977697759] [2024-10-11 19:29:54,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:29:54,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:29:54,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:29:54,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:29:54,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:29:54,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-10-11 19:29:54,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:29:54,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:29:54,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-10-11 19:29:54,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:06,494 INFO L124 PetriNetUnfolderBase]: 153983/191303 cut-off events. [2024-10-11 19:30:06,494 INFO L125 PetriNetUnfolderBase]: For 11648/11648 co-relation queries the response was YES. [2024-10-11 19:30:06,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393239 conditions, 191303 events. 153983/191303 cut-off events. For 11648/11648 co-relation queries the response was YES. Maximal size of possible extension queue 6618. Compared 1068691 event pairs, 76663 based on Foata normal form. 0/150265 useless extension candidates. Maximal degree in co-relation 393230. Up to 190281 conditions per place. [2024-10-11 19:30:07,696 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 43 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-10-11 19:30:07,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 285 flow [2024-10-11 19:30:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:30:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:30:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-10-11 19:30:07,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6805555555555556 [2024-10-11 19:30:07,697 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 124 flow. Second operand 3 states and 98 transitions. [2024-10-11 19:30:07,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 285 flow [2024-10-11 19:30:07,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:30:07,711 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 181 flow [2024-10-11 19:30:07,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-10-11 19:30:07,712 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2024-10-11 19:30:07,712 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 181 flow [2024-10-11 19:30:07,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:07,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:07,712 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:07,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 19:30:07,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-11 19:30:07,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1758150479, now seen corresponding path program 1 times [2024-10-11 19:30:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:07,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081432361] [2024-10-11 19:30:07,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:07,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 19:30:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081432361] [2024-10-11 19:30:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081432361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:07,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:07,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:30:07,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321117201] [2024-10-11 19:30:07,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:07,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:30:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:07,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:30:07,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:30:07,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-10-11 19:30:07,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:07,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:07,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-10-11 19:30:07,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:14,816 INFO L124 PetriNetUnfolderBase]: 78146/108409 cut-off events. [2024-10-11 19:30:14,816 INFO L125 PetriNetUnfolderBase]: For 48322/48322 co-relation queries the response was YES. [2024-10-11 19:30:15,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224307 conditions, 108409 events. 78146/108409 cut-off events. For 48322/48322 co-relation queries the response was YES. Maximal size of possible extension queue 4489. Compared 791435 event pairs, 35211 based on Foata normal form. 34312/134944 useless extension candidates. Maximal degree in co-relation 224296. Up to 83683 conditions per place. [2024-10-11 19:30:15,550 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 38 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2024-10-11 19:30:15,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 306 flow [2024-10-11 19:30:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:30:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:30:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-10-11 19:30:15,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-10-11 19:30:15,551 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 181 flow. Second operand 3 states and 92 transitions. [2024-10-11 19:30:15,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 306 flow [2024-10-11 19:30:15,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:30:15,564 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 192 flow [2024-10-11 19:30:15,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-10-11 19:30:15,564 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2024-10-11 19:30:15,564 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 192 flow [2024-10-11 19:30:15,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:15,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:15,565 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:15,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 19:30:15,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-11 19:30:15,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash 520026501, now seen corresponding path program 1 times [2024-10-11 19:30:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:15,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545532526] [2024-10-11 19:30:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:30:15,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:30:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:30:15,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:30:15,585 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:30:15,585 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-11 19:30:15,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2024-10-11 19:30:15,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2024-10-11 19:30:15,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 9 remaining) [2024-10-11 19:30:15,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2024-10-11 19:30:15,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2024-10-11 19:30:15,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2024-10-11 19:30:15,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2024-10-11 19:30:15,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-10-11 19:30:15,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 19:30:15,587 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 19:30:15,587 WARN L239 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 19:30:15,588 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-10-11 19:30:15,611 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:30:15,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 55 transitions, 180 flow [2024-10-11 19:30:15,619 INFO L124 PetriNetUnfolderBase]: 0/83 cut-off events. [2024-10-11 19:30:15,620 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-10-11 19:30:15,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 83 events. 0/83 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 272 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2024-10-11 19:30:15,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 55 transitions, 180 flow [2024-10-11 19:30:15,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 55 transitions, 180 flow [2024-10-11 19:30:15,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:30:15,622 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;@427f142, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:30:15,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 19:30:15,623 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:30:15,623 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-11 19:30:15,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:30:15,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:15,623 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:30:15,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-10-11 19:30:15,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash 353321, now seen corresponding path program 1 times [2024-10-11 19:30:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:15,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081860266] [2024-10-11 19:30:15,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:15,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:15,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:15,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081860266] [2024-10-11 19:30:15,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081860266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:15,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:15,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:30:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497659660] [2024-10-11 19:30:15,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:15,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 19:30:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 19:30:15,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 19:30:15,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:30:15,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 180 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:15,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:15,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:30:15,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand