./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:25:19,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:25:19,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:25:19,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:25:19,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:25:19,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:25:19,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:25:19,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:25:19,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:25:19,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:25:19,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:25:19,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:25:19,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:25:19,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:25:19,966 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:25:19,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:25:19,966 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:25:19,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:25:19,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:25:19,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:25:19,968 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:25:19,968 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:25:19,969 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:25:19,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:25:19,969 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:25:19,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:25:19,970 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:25:19,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:25:19,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:25:19,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:25:19,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:25:19,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:25:19,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:25:19,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:25:19,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:25:19,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:25:19,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:25:19,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:25:19,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:25:19,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:25:19,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:25:19,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:25:19,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 [2024-11-09 10:25:20,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:25:20,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:25:20,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:25:20,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:25:20,297 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:25:20,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2024-11-09 10:25:21,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:25:22,059 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:25:22,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2024-11-09 10:25:22,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f830fbf6/253842997a384edfa5841e205d26d827/FLAG51a8a3d17 [2024-11-09 10:25:22,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f830fbf6/253842997a384edfa5841e205d26d827 [2024-11-09 10:25:22,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:25:22,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:25:22,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:25:22,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:25:22,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:25:22,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a5e83e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22, skipping insertion in model container [2024-11-09 10:25:22,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:25:22,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:25:22,541 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:25:22,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:25:22,630 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:25:22,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22 WrapperNode [2024-11-09 10:25:22,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:25:22,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:25:22,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:25:22,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:25:22,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,674 INFO L138 Inliner]: procedures = 168, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2024-11-09 10:25:22,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:25:22,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:25:22,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:25:22,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:25:22,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,709 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-11-09 10:25:22,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:25:22,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:25:22,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:25:22,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:25:22,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (1/1) ... [2024-11-09 10:25:22,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:25:22,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:25:22,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:25:22,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:25:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-09 10:25:22,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-09 10:25:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:25:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:25:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:25:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:25:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:25:22,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:25:22,814 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:25:22,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:25:22,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:25:23,041 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:25:23,042 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:25:23,138 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:25:23,138 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 10:25:23,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:25:23 BoogieIcfgContainer [2024-11-09 10:25:23,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:25:23,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:25:23,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:25:23,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:25:23,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:25:22" (1/3) ... [2024-11-09 10:25:23,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66962b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:25:23, skipping insertion in model container [2024-11-09 10:25:23,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:22" (2/3) ... [2024-11-09 10:25:23,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66962b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:25:23, skipping insertion in model container [2024-11-09 10:25:23,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:25:23" (3/3) ... [2024-11-09 10:25:23,147 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2024-11-09 10:25:23,165 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:25:23,166 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:25:23,166 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:25:23,214 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:25:23,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 13 transitions, 30 flow [2024-11-09 10:25:23,275 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-11-09 10:25:23,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:25:23,279 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-11-09 10:25:23,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 16 places, 13 transitions, 30 flow [2024-11-09 10:25:23,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 16 places, 13 transitions, 30 flow [2024-11-09 10:25:23,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:25:23,307 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;@696b0ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:25:23,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 10:25:23,314 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:25:23,314 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:25:23,315 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:25:23,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:23,316 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:25:23,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:25:23,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash 129896, now seen corresponding path program 1 times [2024-11-09 10:25:23,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:23,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058606246] [2024-11-09 10:25:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:23,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:23,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058606246] [2024-11-09 10:25:23,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058606246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:23,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:23,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:25:23,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464168789] [2024-11-09 10:25:23,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:23,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:25:23,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:23,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:25:23,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:25:23,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 13 [2024-11-09 10:25:23,585 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-11-09 10:25:23,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:23,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 13 [2024-11-09 10:25:23,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:23,610 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-09 10:25:23,610 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:25:23,611 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-11-09 10:25:23,612 INFO L140 encePairwiseOnDemand]: 12/13 looper letters, 6 selfloop transitions, 0 changer transitions 0/10 dead transitions. [2024-11-09 10:25:23,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 10 transitions, 36 flow [2024-11-09 10:25:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:25:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:25:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 17 transitions. [2024-11-09 10:25:23,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2024-11-09 10:25:23,623 INFO L175 Difference]: Start difference. First operand has 16 places, 13 transitions, 30 flow. Second operand 2 states and 17 transitions. [2024-11-09 10:25:23,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 10 transitions, 36 flow [2024-11-09 10:25:23,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 10 transitions, 36 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:23,626 INFO L231 Difference]: Finished difference. Result has 14 places, 10 transitions, 24 flow [2024-11-09 10:25:23,628 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-11-09 10:25:23,631 INFO L277 CegarLoopForPetriNet]: 16 programPoint places, -2 predicate places. [2024-11-09 10:25:23,632 INFO L471 AbstractCegarLoop]: Abstraction has has 14 places, 10 transitions, 24 flow [2024-11-09 10:25:23,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:25:23,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:23,632 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-09 10:25:23,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:25:23,633 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-11-09 10:25:23,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:23,634 INFO L85 PathProgramCache]: Analyzing trace with hash 124814821, now seen corresponding path program 1 times [2024-11-09 10:25:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:23,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208251557] [2024-11-09 10:25:23,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:23,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:25:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:23,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:25:23,719 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:25:23,721 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-09 10:25:23,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-09 10:25:23,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-11-09 10:25:23,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2024-11-09 10:25:23,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:25:23,729 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 10:25:23,732 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:25:23,732 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 10:25:23,749 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:25:23,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 50 flow [2024-11-09 10:25:23,759 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-09 10:25:23,759 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:25:23,759 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-11-09 10:25:23,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 20 transitions, 50 flow [2024-11-09 10:25:23,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 50 flow [2024-11-09 10:25:23,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:25:23,763 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;@696b0ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:25:23,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 10:25:23,766 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:25:23,769 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:25:23,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:25:23,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:23,772 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:25:23,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 10:25:23,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash 149756, now seen corresponding path program 1 times [2024-11-09 10:25:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:23,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017573977] [2024-11-09 10:25:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:23,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:23,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017573977] [2024-11-09 10:25:23,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017573977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:23,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:23,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:25:23,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945633052] [2024-11-09 10:25:23,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:23,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:25:23,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:23,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:25:23,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:25:23,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 20 [2024-11-09 10:25:23,826 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-11-09 10:25:23,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:23,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 20 [2024-11-09 10:25:23,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:23,890 INFO L124 PetriNetUnfolderBase]: 39/112 cut-off events. [2024-11-09 10:25:23,891 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-09 10:25:23,892 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-11-09 10:25:23,893 INFO L140 encePairwiseOnDemand]: 19/20 looper letters, 10 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2024-11-09 10:25:23,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 64 flow [2024-11-09 10:25:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:25:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:25:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2024-11-09 10:25:23,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-11-09 10:25:23,895 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 50 flow. Second operand 2 states and 27 transitions. [2024-11-09 10:25:23,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 64 flow [2024-11-09 10:25:23,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 64 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:23,897 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 44 flow [2024-11-09 10:25:23,897 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-11-09 10:25:23,899 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-11-09 10:25:23,899 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 44 flow [2024-11-09 10:25:23,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:25:23,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:23,900 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:25:23,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:25:23,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 10:25:23,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:23,902 INFO L85 PathProgramCache]: Analyzing trace with hash 143907184, now seen corresponding path program 1 times [2024-11-09 10:25:23,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:23,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223355676] [2024-11-09 10:25:23,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:23,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:24,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223355676] [2024-11-09 10:25:24,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223355676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:24,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:24,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:25:24,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297173708] [2024-11-09 10:25:24,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:24,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:25:24,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:24,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:25:24,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:25:24,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2024-11-09 10:25:24,089 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-11-09 10:25:24,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:24,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2024-11-09 10:25:24,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:24,147 INFO L124 PetriNetUnfolderBase]: 47/107 cut-off events. [2024-11-09 10:25:24,147 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-09 10:25:24,148 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-11-09 10:25:24,149 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 15 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2024-11-09 10:25:24,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 97 flow [2024-11-09 10:25:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:25:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:25:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2024-11-09 10:25:24,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-11-09 10:25:24,153 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 44 flow. Second operand 3 states and 38 transitions. [2024-11-09 10:25:24,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 97 flow [2024-11-09 10:25:24,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 97 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:24,156 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 65 flow [2024-11-09 10:25:24,157 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-11-09 10:25:24,158 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2024-11-09 10:25:24,158 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 65 flow [2024-11-09 10:25:24,158 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-11-09 10:25:24,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:24,158 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2024-11-09 10:25:24,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:25:24,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 10:25:24,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash 855384093, now seen corresponding path program 1 times [2024-11-09 10:25:24,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:24,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081102954] [2024-11-09 10:25:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:24,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:25:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:24,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:25:24,205 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:25:24,205 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-09 10:25:24,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-09 10:25:24,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2024-11-09 10:25:24,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2024-11-09 10:25:24,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-09 10:25:24,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:25:24,208 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 10:25:24,209 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:25:24,209 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 10:25:24,239 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:25:24,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 72 flow [2024-11-09 10:25:24,250 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-11-09 10:25:24,251 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 10:25:24,251 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-11-09 10:25:24,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 27 transitions, 72 flow [2024-11-09 10:25:24,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 27 transitions, 72 flow [2024-11-09 10:25:24,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:25:24,257 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;@696b0ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:25:24,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 10:25:24,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:25:24,259 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:25:24,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:25:24,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:24,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:25:24,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:25:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash 176567, now seen corresponding path program 1 times [2024-11-09 10:25:24,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:24,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346590495] [2024-11-09 10:25:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:24,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:24,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346590495] [2024-11-09 10:25:24,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346590495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:24,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:24,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:25:24,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119538660] [2024-11-09 10:25:24,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:24,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:25:24,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:24,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:25:24,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:25:24,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 27 [2024-11-09 10:25:24,291 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-11-09 10:25:24,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:24,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 27 [2024-11-09 10:25:24,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:24,447 INFO L124 PetriNetUnfolderBase]: 279/576 cut-off events. [2024-11-09 10:25:24,448 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-11-09 10:25:24,453 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-11-09 10:25:24,464 INFO L140 encePairwiseOnDemand]: 26/27 looper letters, 14 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2024-11-09 10:25:24,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 24 transitions, 94 flow [2024-11-09 10:25:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:25:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:25:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2024-11-09 10:25:24,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-11-09 10:25:24,466 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 72 flow. Second operand 2 states and 37 transitions. [2024-11-09 10:25:24,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 24 transitions, 94 flow [2024-11-09 10:25:24,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:24,469 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 64 flow [2024-11-09 10:25:24,469 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-11-09 10:25:24,472 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2024-11-09 10:25:24,473 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 64 flow [2024-11-09 10:25:24,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:25:24,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:24,474 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:25:24,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:25:24,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:25:24,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:24,475 INFO L85 PathProgramCache]: Analyzing trace with hash 169679185, now seen corresponding path program 1 times [2024-11-09 10:25:24,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:24,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032217646] [2024-11-09 10:25:24,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:24,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:24,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:24,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032217646] [2024-11-09 10:25:24,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032217646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:24,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:24,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:25:24,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425641836] [2024-11-09 10:25:24,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:24,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:25:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:24,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:25:24,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:25:24,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-09 10:25:24,556 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-11-09 10:25:24,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:24,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-09 10:25:24,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:24,697 INFO L124 PetriNetUnfolderBase]: 447/731 cut-off events. [2024-11-09 10:25:24,697 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-09 10:25:24,701 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-11-09 10:25:24,708 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 22 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2024-11-09 10:25:24,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 144 flow [2024-11-09 10:25:24,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:25:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:25:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-11-09 10:25:24,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-11-09 10:25:24,710 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 64 flow. Second operand 3 states and 53 transitions. [2024-11-09 10:25:24,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 144 flow [2024-11-09 10:25:24,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:24,712 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 94 flow [2024-11-09 10:25:24,712 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-11-09 10:25:24,716 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2024-11-09 10:25:24,716 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 94 flow [2024-11-09 10:25:24,716 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-11-09 10:25:24,716 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:24,717 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-11-09 10:25:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:25:24,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:25:24,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash -32874455, now seen corresponding path program 1 times [2024-11-09 10:25:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762851952] [2024-11-09 10:25:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:24,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:25:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:24,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:25:24,762 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:25:24,762 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-09 10:25:24,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-09 10:25:24,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-09 10:25:24,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2024-11-09 10:25:24,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-11-09 10:25:24,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-09 10:25:24,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:25:24,763 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 10:25:24,764 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:25:24,764 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-09 10:25:24,793 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:25:24,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 96 flow [2024-11-09 10:25:24,804 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2024-11-09 10:25:24,804 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-09 10:25:24,804 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-11-09 10:25:24,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 34 transitions, 96 flow [2024-11-09 10:25:24,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 34 transitions, 96 flow [2024-11-09 10:25:24,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:25:24,808 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;@696b0ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:25:24,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:25:24,809 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:25:24,809 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:25:24,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:25:24,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:24,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:25:24,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:25:24,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash 210329, now seen corresponding path program 1 times [2024-11-09 10:25:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:24,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837806650] [2024-11-09 10:25:24,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:24,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837806650] [2024-11-09 10:25:24,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837806650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:24,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:24,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:25:24,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260561444] [2024-11-09 10:25:24,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:24,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:25:24,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:24,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:25:24,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:25:24,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-09 10:25:24,838 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-11-09 10:25:24,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:24,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-09 10:25:24,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:25,163 INFO L124 PetriNetUnfolderBase]: 1623/2816 cut-off events. [2024-11-09 10:25:25,164 INFO L125 PetriNetUnfolderBase]: For 1972/1972 co-relation queries the response was YES. [2024-11-09 10:25:25,172 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-11-09 10:25:25,193 INFO L140 encePairwiseOnDemand]: 33/34 looper letters, 18 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2024-11-09 10:25:25,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 126 flow [2024-11-09 10:25:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:25:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:25:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2024-11-09 10:25:25,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-11-09 10:25:25,196 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 96 flow. Second operand 2 states and 47 transitions. [2024-11-09 10:25:25,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 126 flow [2024-11-09 10:25:25,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 120 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:25,203 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 84 flow [2024-11-09 10:25:25,206 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-11-09 10:25:25,207 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-11-09 10:25:25,207 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 84 flow [2024-11-09 10:25:25,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:25:25,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:25,207 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:25:25,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:25:25,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:25:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:25,209 INFO L85 PathProgramCache]: Analyzing trace with hash 202131513, now seen corresponding path program 1 times [2024-11-09 10:25:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:25,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481446956] [2024-11-09 10:25:25,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:25,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:25,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481446956] [2024-11-09 10:25:25,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481446956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:25,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:25,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:25:25,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090674444] [2024-11-09 10:25:25,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:25,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:25:25,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:25,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:25:25,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:25:25,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-11-09 10:25:25,285 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-11-09 10:25:25,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:25,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-11-09 10:25:25,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:25,707 INFO L124 PetriNetUnfolderBase]: 3473/4901 cut-off events. [2024-11-09 10:25:25,708 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2024-11-09 10:25:25,718 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-11-09 10:25:25,753 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 29 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2024-11-09 10:25:25,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 191 flow [2024-11-09 10:25:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:25:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:25:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-11-09 10:25:25,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 10:25:25,756 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 84 flow. Second operand 3 states and 68 transitions. [2024-11-09 10:25:25,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 191 flow [2024-11-09 10:25:25,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 191 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:25,759 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 123 flow [2024-11-09 10:25:25,759 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-11-09 10:25:25,762 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-11-09 10:25:25,762 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 123 flow [2024-11-09 10:25:25,762 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-11-09 10:25:25,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:25,762 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-11-09 10:25:25,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:25:25,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:25:25,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:25,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1408167593, now seen corresponding path program 1 times [2024-11-09 10:25:25,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:25,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608824653] [2024-11-09 10:25:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:25,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:25,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:25:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:25,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:25:25,796 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:25:25,797 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:25:25,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:25:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:25:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-09 10:25:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-09 10:25:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:25:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:25:25,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:25:25,802 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 10:25:25,803 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:25:25,803 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-09 10:25:25,833 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:25:25,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 122 flow [2024-11-09 10:25:25,846 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2024-11-09 10:25:25,846 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-09 10:25:25,846 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-11-09 10:25:25,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 41 transitions, 122 flow [2024-11-09 10:25:25,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 41 transitions, 122 flow [2024-11-09 10:25:25,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:25:25,850 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;@696b0ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:25:25,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 10:25:25,851 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:25:25,851 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:25:25,851 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:25:25,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:25,852 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:25:25,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-09 10:25:25,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:25,852 INFO L85 PathProgramCache]: Analyzing trace with hash 251042, now seen corresponding path program 1 times [2024-11-09 10:25:25,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:25,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74838724] [2024-11-09 10:25:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:25,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:25,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:25,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74838724] [2024-11-09 10:25:25,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74838724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:25,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:25,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:25:25,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424418738] [2024-11-09 10:25:25,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:25,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:25:25,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:25,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:25:25,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:25:25,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-11-09 10:25:25,872 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-11-09 10:25:25,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:25,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-11-09 10:25:25,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:27,228 INFO L124 PetriNetUnfolderBase]: 8535/13312 cut-off events. [2024-11-09 10:25:27,229 INFO L125 PetriNetUnfolderBase]: For 13236/13236 co-relation queries the response was YES. [2024-11-09 10:25:27,265 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-11-09 10:25:27,363 INFO L140 encePairwiseOnDemand]: 40/41 looper letters, 22 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-11-09 10:25:27,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 160 flow [2024-11-09 10:25:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:25:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:25:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2024-11-09 10:25:27,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6951219512195121 [2024-11-09 10:25:27,365 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 122 flow. Second operand 2 states and 57 transitions. [2024-11-09 10:25:27,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 160 flow [2024-11-09 10:25:27,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 148 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:27,377 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 104 flow [2024-11-09 10:25:27,378 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-11-09 10:25:27,378 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-11-09 10:25:27,378 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 104 flow [2024-11-09 10:25:27,379 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-11-09 10:25:27,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:27,379 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:25:27,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:25:27,379 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-11-09 10:25:27,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash 241263592, now seen corresponding path program 1 times [2024-11-09 10:25:27,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:27,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852709068] [2024-11-09 10:25:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852709068] [2024-11-09 10:25:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852709068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:27,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:27,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:25:27,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061388121] [2024-11-09 10:25:27,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:27,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:25:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:27,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:25:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:25:27,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-11-09 10:25:27,431 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-11-09 10:25:27,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:27,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-11-09 10:25:27,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:30,171 INFO L124 PetriNetUnfolderBase]: 24009/31313 cut-off events. [2024-11-09 10:25:30,171 INFO L125 PetriNetUnfolderBase]: For 2330/2330 co-relation queries the response was YES. [2024-11-09 10:25:30,226 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-11-09 10:25:30,416 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 36 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-11-09 10:25:30,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 238 flow [2024-11-09 10:25:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:25:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:25:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-09 10:25:30,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6747967479674797 [2024-11-09 10:25:30,419 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 104 flow. Second operand 3 states and 83 transitions. [2024-11-09 10:25:30,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 238 flow [2024-11-09 10:25:30,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 238 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:30,423 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 152 flow [2024-11-09 10:25:30,423 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-11-09 10:25:30,424 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-09 10:25:30,424 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 152 flow [2024-11-09 10:25:30,424 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-11-09 10:25:30,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:30,424 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:25:30,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:25:30,425 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-11-09 10:25:30,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash -847865375, now seen corresponding path program 1 times [2024-11-09 10:25:30,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321343499] [2024-11-09 10:25:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:30,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:30,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321343499] [2024-11-09 10:25:30,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321343499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:30,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:30,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:25:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358733599] [2024-11-09 10:25:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:30,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:25:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:30,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:25:30,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:25:30,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-11-09 10:25:30,485 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-11-09 10:25:30,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:30,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-11-09 10:25:30,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:32,011 INFO L124 PetriNetUnfolderBase]: 13439/19846 cut-off events. [2024-11-09 10:25:32,011 INFO L125 PetriNetUnfolderBase]: For 7894/7894 co-relation queries the response was YES. [2024-11-09 10:25:32,052 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-11-09 10:25:32,148 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 32 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-11-09 10:25:32,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 256 flow [2024-11-09 10:25:32,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:25:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:25:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-09 10:25:32,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2024-11-09 10:25:32,150 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 152 flow. Second operand 3 states and 78 transitions. [2024-11-09 10:25:32,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 256 flow [2024-11-09 10:25:32,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:25:32,153 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 161 flow [2024-11-09 10:25:32,153 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-11-09 10:25:32,154 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-11-09 10:25:32,154 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 161 flow [2024-11-09 10:25:32,154 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-11-09 10:25:32,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:32,155 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:25:32,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:25:32,155 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-11-09 10:25:32,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash -761048003, now seen corresponding path program 1 times [2024-11-09 10:25:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:32,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559002873] [2024-11-09 10:25:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:32,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:25:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:32,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:25:32,192 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:25:32,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-11-09 10:25:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-09 10:25:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-09 10:25:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2024-11-09 10:25:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2024-11-09 10:25:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2024-11-09 10:25:32,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2024-11-09 10:25:32,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-09 10:25:32,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:25:32,194 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:25:32,195 WARN L244 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:25:32,195 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-09 10:25:32,223 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:25:32,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 48 transitions, 150 flow [2024-11-09 10:25:32,231 INFO L124 PetriNetUnfolderBase]: 0/72 cut-off events. [2024-11-09 10:25:32,231 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-11-09 10:25:32,231 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-11-09 10:25:32,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 48 transitions, 150 flow [2024-11-09 10:25:32,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 48 transitions, 150 flow [2024-11-09 10:25:32,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:25:32,234 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;@696b0ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:25:32,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 10:25:32,235 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:25:32,235 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:25:32,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:25:32,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:32,235 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:25:32,236 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-11-09 10:25:32,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash 298706, now seen corresponding path program 1 times [2024-11-09 10:25:32,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:32,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46498108] [2024-11-09 10:25:32,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:32,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:32,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46498108] [2024-11-09 10:25:32,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46498108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:32,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:32,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:25:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359098182] [2024-11-09 10:25:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:25:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:32,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:25:32,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:25:32,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-09 10:25:32,250 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-11-09 10:25:32,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:32,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-09 10:25:32,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:37,010 INFO L124 PetriNetUnfolderBase]: 42327/61440 cut-off events. [2024-11-09 10:25:37,011 INFO L125 PetriNetUnfolderBase]: For 79796/79796 co-relation queries the response was YES. [2024-11-09 10:25:37,137 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-11-09 10:25:37,462 INFO L140 encePairwiseOnDemand]: 47/48 looper letters, 26 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2024-11-09 10:25:37,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 196 flow [2024-11-09 10:25:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:25:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:25:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2024-11-09 10:25:37,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2024-11-09 10:25:37,464 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 150 flow. Second operand 2 states and 67 transitions. [2024-11-09 10:25:37,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 196 flow [2024-11-09 10:25:37,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 45 transitions, 176 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:37,556 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 124 flow [2024-11-09 10:25:37,556 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-11-09 10:25:37,557 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2024-11-09 10:25:37,557 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 124 flow [2024-11-09 10:25:37,557 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-11-09 10:25:37,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:37,557 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:25:37,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:25:37,558 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-11-09 10:25:37,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash 287075998, now seen corresponding path program 1 times [2024-11-09 10:25:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:37,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115799939] [2024-11-09 10:25:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:37,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:37,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115799939] [2024-11-09 10:25:37,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115799939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:37,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:37,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:25:37,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561543969] [2024-11-09 10:25:37,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:37,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:25:37,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:37,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:25:37,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:25:37,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-09 10:25:37,606 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-11-09 10:25:37,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:37,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-09 10:25:37,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:49,929 INFO L124 PetriNetUnfolderBase]: 153983/191303 cut-off events. [2024-11-09 10:25:49,929 INFO L125 PetriNetUnfolderBase]: For 11648/11648 co-relation queries the response was YES. [2024-11-09 10:25:50,437 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-11-09 10:25:51,272 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 43 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-09 10:25:51,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 285 flow [2024-11-09 10:25:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:25:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:25:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-11-09 10:25:51,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6805555555555556 [2024-11-09 10:25:51,274 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 124 flow. Second operand 3 states and 98 transitions. [2024-11-09 10:25:51,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 285 flow [2024-11-09 10:25:51,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:25:51,289 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 181 flow [2024-11-09 10:25:51,289 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-11-09 10:25:51,290 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2024-11-09 10:25:51,290 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 181 flow [2024-11-09 10:25:51,290 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-11-09 10:25:51,290 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:51,290 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:25:51,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:25:51,290 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-11-09 10:25:51,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1758150479, now seen corresponding path program 1 times [2024-11-09 10:25:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:51,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255984455] [2024-11-09 10:25:51,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:51,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:25:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255984455] [2024-11-09 10:25:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255984455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:51,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:51,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:25:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257137917] [2024-11-09 10:25:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:25:51,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:51,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:25:51,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:25:51,342 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-09 10:25:51,342 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-11-09 10:25:51,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:51,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-09 10:25:51,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:25:58,136 INFO L124 PetriNetUnfolderBase]: 78146/108409 cut-off events. [2024-11-09 10:25:58,136 INFO L125 PetriNetUnfolderBase]: For 48322/48322 co-relation queries the response was YES. [2024-11-09 10:25:58,502 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-11-09 10:25:58,848 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 38 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2024-11-09 10:25:58,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 306 flow [2024-11-09 10:25:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:25:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:25:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-09 10:25:58,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-09 10:25:58,849 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 181 flow. Second operand 3 states and 92 transitions. [2024-11-09 10:25:58,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 306 flow [2024-11-09 10:25:58,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:25:58,867 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 192 flow [2024-11-09 10:25:58,867 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-11-09 10:25:58,868 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2024-11-09 10:25:58,868 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 192 flow [2024-11-09 10:25:58,868 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-11-09 10:25:58,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:58,868 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:25:58,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:25:58,868 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-11-09 10:25:58,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:58,869 INFO L85 PathProgramCache]: Analyzing trace with hash 520026501, now seen corresponding path program 1 times [2024-11-09 10:25:58,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:58,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105021177] [2024-11-09 10:25:58,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:58,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:58,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:25:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:25:58,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:25:58,892 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:25:58,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-09 10:25:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2024-11-09 10:25:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2024-11-09 10:25:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 9 remaining) [2024-11-09 10:25:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2024-11-09 10:25:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2024-11-09 10:25:58,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2024-11-09 10:25:58,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2024-11-09 10:25:58,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-11-09 10:25:58,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:25:58,893 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:25:58,894 WARN L244 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:25:58,894 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-11-09 10:25:58,917 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:25:58,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 55 transitions, 180 flow [2024-11-09 10:25:58,923 INFO L124 PetriNetUnfolderBase]: 0/83 cut-off events. [2024-11-09 10:25:58,923 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-09 10:25:58,923 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-11-09 10:25:58,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 55 transitions, 180 flow [2024-11-09 10:25:58,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 55 transitions, 180 flow [2024-11-09 10:25:58,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:25:58,925 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;@696b0ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:25:58,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-09 10:25:58,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:25:58,926 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:25:58,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:25:58,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:25:58,926 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:25:58,927 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-11-09 10:25:58,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:25:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash 353321, now seen corresponding path program 1 times [2024-11-09 10:25:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:25:58,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187936036] [2024-11-09 10:25:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:25:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:25:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:25:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:25:58,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:25:58,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187936036] [2024-11-09 10:25:58,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187936036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:25:58,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:25:58,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:25:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416880742] [2024-11-09 10:25:58,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:25:58,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:25:58,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:25:58,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:25:58,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:25:58,937 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-09 10:25:58,937 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-11-09 10:25:58,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:25:58,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-09 10:25:58,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand