./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:13:00,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:13:00,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:13:00,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:13:00,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:13:00,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:13:00,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:13:00,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:13:00,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:13:00,233 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:13:00,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:13:00,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:13:00,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:13:00,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:13:00,233 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:13:00,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:13:00,233 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:13:00,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:13:00,234 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:13:00,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:13:00,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:13:00,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:13:00,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:13:00,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:13:00,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:13:00,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:13:00,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:13:00,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:13:00,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:13:00,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:13:00,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:13:00,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:13:00,236 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 [2025-02-08 08:13:00,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:13:00,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:13:00,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:13:00,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:13:00,462 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:13:00,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-02-08 08:13:01,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64d863723/f7a746d3c5b64de68d3b26fc0e17be70/FLAG8cd2b313d [2025-02-08 08:13:01,982 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:13:01,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-02-08 08:13:01,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64d863723/f7a746d3c5b64de68d3b26fc0e17be70/FLAG8cd2b313d [2025-02-08 08:13:02,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64d863723/f7a746d3c5b64de68d3b26fc0e17be70 [2025-02-08 08:13:02,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:13:02,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:13:02,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:13:02,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:13:02,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:13:02,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f302b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02, skipping insertion in model container [2025-02-08 08:13:02,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:13:02,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:13:02,251 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:13:02,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:13:02,295 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:13:02,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02 WrapperNode [2025-02-08 08:13:02,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:13:02,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:13:02,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:13:02,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:13:02,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,318 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 57 [2025-02-08 08:13:02,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:13:02,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:13:02,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:13:02,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:13:02,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,335 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]. [2025-02-08 08:13:02,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:13:02,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:13:02,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:13:02,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:13:02,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (1/1) ... [2025-02-08 08:13:02,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:13:02,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:13:02,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:13:02,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:13:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 08:13:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 08:13:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:13:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:13:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:13:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:13:02,400 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:13:02,466 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:13:02,472 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:13:02,559 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:13:02,560 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:13:02,614 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:13:02,614 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:13:02,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:13:02 BoogieIcfgContainer [2025-02-08 08:13:02,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:13:02,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:13:02,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:13:02,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:13:02,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:13:02" (1/3) ... [2025-02-08 08:13:02,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbb5cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:13:02, skipping insertion in model container [2025-02-08 08:13:02,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:02" (2/3) ... [2025-02-08 08:13:02,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbb5cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:13:02, skipping insertion in model container [2025-02-08 08:13:02,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:13:02" (3/3) ... [2025-02-08 08:13:02,622 INFO L128 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2025-02-08 08:13:02,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:13:02,635 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 29_conditionals_vs.i that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-08 08:13:02,635 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:13:02,675 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:02,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 24 transitions, 52 flow [2025-02-08 08:13:02,718 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2025-02-08 08:13:02,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:02,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 21. Up to 3 conditions per place. [2025-02-08 08:13:02,726 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 24 transitions, 52 flow [2025-02-08 08:13:02,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 24 transitions, 52 flow [2025-02-08 08:13:02,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:02,746 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;@32a115f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:02,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 08:13:02,749 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:02,750 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:13:02,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:02,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:02,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:13:02,751 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)] === [2025-02-08 08:13:02,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash 160169, now seen corresponding path program 1 times [2025-02-08 08:13:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466270318] [2025-02-08 08:13:02,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:02,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:02,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:13:02,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:13:02,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:02,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:02,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:02,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466270318] [2025-02-08 08:13:02,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466270318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:02,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:02,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:02,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036793803] [2025-02-08 08:13:02,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:02,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:02,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:02,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:02,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:02,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 24 [2025-02-08 08:13:02,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 24 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:02,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:02,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 24 [2025-02-08 08:13:02,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:02,919 INFO L124 PetriNetUnfolderBase]: 15/58 cut-off events. [2025-02-08 08:13:02,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:02,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 58 events. 15/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 162 event pairs, 12 based on Foata normal form. 6/58 useless extension candidates. Maximal degree in co-relation 85. Up to 36 conditions per place. [2025-02-08 08:13:02,920 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 10 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2025-02-08 08:13:02,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 18 transitions, 60 flow [2025-02-08 08:13:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2025-02-08 08:13:02,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-02-08 08:13:02,933 INFO L175 Difference]: Start difference. First operand has 24 places, 24 transitions, 52 flow. Second operand 2 states and 31 transitions. [2025-02-08 08:13:02,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 18 transitions, 60 flow [2025-02-08 08:13:02,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 18 transitions, 60 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:02,937 INFO L231 Difference]: Finished difference. Result has 21 places, 18 transitions, 40 flow [2025-02-08 08:13:02,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=18} [2025-02-08 08:13:02,942 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, -3 predicate places. [2025-02-08 08:13:02,943 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 18 transitions, 40 flow [2025-02-08 08:13:02,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:02,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:02,944 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:13:02,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:13:02,944 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)] === [2025-02-08 08:13:02,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash 478305983, now seen corresponding path program 1 times [2025-02-08 08:13:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:02,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230860586] [2025-02-08 08:13:02,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:02,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:02,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:13:02,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:13:02,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:02,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:02,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:02,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:13:02,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:13:02,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:02,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:02,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:02,982 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:02,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-08 08:13:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-02-08 08:13:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-02-08 08:13:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-02-08 08:13:02,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:13:02,984 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:13:02,988 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:02,988 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:13:03,009 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:03,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 41 transitions, 92 flow [2025-02-08 08:13:03,023 INFO L124 PetriNetUnfolderBase]: 6/50 cut-off events. [2025-02-08 08:13:03,025 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:13:03,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 50 events. 6/50 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2025-02-08 08:13:03,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 41 transitions, 92 flow [2025-02-08 08:13:03,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 41 transitions, 92 flow [2025-02-08 08:13:03,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:03,031 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;@32a115f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:03,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 08:13:03,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:03,033 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:13:03,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:03,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:03,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:13:03,033 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)] === [2025-02-08 08:13:03,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:03,033 INFO L85 PathProgramCache]: Analyzing trace with hash 200882, now seen corresponding path program 1 times [2025-02-08 08:13:03,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:03,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123043868] [2025-02-08 08:13:03,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:03,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:13:03,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:13:03,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:03,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123043868] [2025-02-08 08:13:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123043868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:03,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:03,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:03,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075905282] [2025-02-08 08:13:03,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:03,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:03,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:03,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:03,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:03,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2025-02-08 08:13:03,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 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) [2025-02-08 08:13:03,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:03,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2025-02-08 08:13:03,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:03,192 INFO L124 PetriNetUnfolderBase]: 246/563 cut-off events. [2025-02-08 08:13:03,192 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 08:13:03,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 563 events. 246/563 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3039 event pairs, 222 based on Foata normal form. 84/587 useless extension candidates. Maximal degree in co-relation 593. Up to 393 conditions per place. [2025-02-08 08:13:03,196 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 17 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2025-02-08 08:13:03,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 108 flow [2025-02-08 08:13:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2025-02-08 08:13:03,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6585365853658537 [2025-02-08 08:13:03,198 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 92 flow. Second operand 2 states and 54 transitions. [2025-02-08 08:13:03,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 108 flow [2025-02-08 08:13:03,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:03,199 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 74 flow [2025-02-08 08:13:03,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-02-08 08:13:03,200 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-02-08 08:13:03,200 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 74 flow [2025-02-08 08:13:03,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 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) [2025-02-08 08:13:03,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:03,200 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 08:13:03,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:13:03,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:13:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash 418299156, now seen corresponding path program 1 times [2025-02-08 08:13:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:03,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722598638] [2025-02-08 08:13:03,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:03,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:03,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:13:03,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:13:03,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:03,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:03,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:03,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:13:03,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:13:03,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:03,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:03,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:03,217 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:03,217 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 08:13:03,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-08 08:13:03,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-02-08 08:13:03,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-02-08 08:13:03,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-08 08:13:03,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:13:03,218 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:13:03,218 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:03,218 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:13:03,234 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:03,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 58 transitions, 134 flow [2025-02-08 08:13:03,241 INFO L124 PetriNetUnfolderBase]: 9/72 cut-off events. [2025-02-08 08:13:03,242 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:13:03,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 72 events. 9/72 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 224 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2025-02-08 08:13:03,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 58 transitions, 134 flow [2025-02-08 08:13:03,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 58 transitions, 134 flow [2025-02-08 08:13:03,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:03,244 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;@32a115f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:03,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:13:03,245 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:03,245 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:13:03,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:03,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:03,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:13:03,245 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)] === [2025-02-08 08:13:03,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:03,245 INFO L85 PathProgramCache]: Analyzing trace with hash 258476, now seen corresponding path program 1 times [2025-02-08 08:13:03,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780578198] [2025-02-08 08:13:03,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:03,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:13:03,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:13:03,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:03,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:03,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:03,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780578198] [2025-02-08 08:13:03,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780578198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:03,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:03,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:03,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118466089] [2025-02-08 08:13:03,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:03,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:03,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:03,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:03,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:03,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 58 [2025-02-08 08:13:03,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 134 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) [2025-02-08 08:13:03,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:03,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 58 [2025-02-08 08:13:03,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:03,664 INFO L124 PetriNetUnfolderBase]: 2742/4967 cut-off events. [2025-02-08 08:13:03,665 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2025-02-08 08:13:03,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8964 conditions, 4967 events. 2742/4967 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 34782 event pairs, 2574 based on Foata normal form. 923/5458 useless extension candidates. Maximal degree in co-relation 1375. Up to 3774 conditions per place. [2025-02-08 08:13:03,741 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 24 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2025-02-08 08:13:03,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 158 flow [2025-02-08 08:13:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2025-02-08 08:13:03,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6637931034482759 [2025-02-08 08:13:03,744 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 134 flow. Second operand 2 states and 77 transitions. [2025-02-08 08:13:03,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 158 flow [2025-02-08 08:13:03,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 156 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:03,747 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 108 flow [2025-02-08 08:13:03,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-02-08 08:13:03,748 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2025-02-08 08:13:03,748 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 108 flow [2025-02-08 08:13:03,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-02-08 08:13:03,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:03,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:03,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:13:03,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:13:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash 824101843, now seen corresponding path program 1 times [2025-02-08 08:13:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478036291] [2025-02-08 08:13:03,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:03,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:03,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:13:03,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:13:03,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:03,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:03,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:03,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478036291] [2025-02-08 08:13:03,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478036291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:03,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:13:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349226460] [2025-02-08 08:13:03,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:03,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:13:03,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:03,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:13:03,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:13:03,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2025-02-08 08:13:03,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:03,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:03,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2025-02-08 08:13:03,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:04,383 INFO L124 PetriNetUnfolderBase]: 4998/7664 cut-off events. [2025-02-08 08:13:04,383 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2025-02-08 08:13:04,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15135 conditions, 7664 events. 4998/7664 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 48694 event pairs, 1006 based on Foata normal form. 0/7112 useless extension candidates. Maximal degree in co-relation 15129. Up to 2815 conditions per place. [2025-02-08 08:13:04,429 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 59 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-02-08 08:13:04,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 77 transitions, 314 flow [2025-02-08 08:13:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:13:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:13:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-02-08 08:13:04,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818965517241379 [2025-02-08 08:13:04,432 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 108 flow. Second operand 4 states and 135 transitions. [2025-02-08 08:13:04,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 77 transitions, 314 flow [2025-02-08 08:13:04,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 77 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:04,523 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 108 flow [2025-02-08 08:13:04,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-02-08 08:13:04,524 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2025-02-08 08:13:04,524 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 108 flow [2025-02-08 08:13:04,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:04,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:04,524 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-08 08:13:04,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:13:04,524 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)] === [2025-02-08 08:13:04,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1458780126, now seen corresponding path program 1 times [2025-02-08 08:13:04,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:04,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51300790] [2025-02-08 08:13:04,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:04,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:13:04,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:13:04,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:04,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:04,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:04,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:13:04,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:13:04,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:04,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:04,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:04,553 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:04,553 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 08:13:04,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 08:13:04,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-08 08:13:04,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-02-08 08:13:04,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-08 08:13:04,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-08 08:13:04,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:13:04,554 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 08:13:04,555 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:04,555 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 08:13:04,578 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:04,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 75 transitions, 178 flow [2025-02-08 08:13:04,585 INFO L124 PetriNetUnfolderBase]: 12/94 cut-off events. [2025-02-08 08:13:04,585 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 08:13:04,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 94 events. 12/94 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 299 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 84. Up to 5 conditions per place. [2025-02-08 08:13:04,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 75 transitions, 178 flow [2025-02-08 08:13:04,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 75 transitions, 178 flow [2025-02-08 08:13:04,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:04,587 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;@32a115f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:04,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:13:04,588 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:04,588 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:13:04,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:04,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:04,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:13:04,589 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)] === [2025-02-08 08:13:04,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:04,589 INFO L85 PathProgramCache]: Analyzing trace with hash 332951, now seen corresponding path program 1 times [2025-02-08 08:13:04,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:04,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334557913] [2025-02-08 08:13:04,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:04,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:04,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:13:04,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:13:04,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:04,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:04,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:04,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334557913] [2025-02-08 08:13:04,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334557913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:04,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:04,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:04,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752076245] [2025-02-08 08:13:04,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:04,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:04,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:04,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:04,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:04,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2025-02-08 08:13:04,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 178 flow. Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:04,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:04,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2025-02-08 08:13:04,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:06,685 INFO L124 PetriNetUnfolderBase]: 26388/41972 cut-off events. [2025-02-08 08:13:06,686 INFO L125 PetriNetUnfolderBase]: For 4416/4416 co-relation queries the response was YES. [2025-02-08 08:13:06,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77526 conditions, 41972 events. 26388/41972 cut-off events. For 4416/4416 co-relation queries the response was YES. Maximal size of possible extension queue 1921. Compared 341671 event pairs, 25212 based on Foata normal form. 8855/47794 useless extension candidates. Maximal degree in co-relation 9016. Up to 33615 conditions per place. [2025-02-08 08:13:06,887 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 31 selfloop transitions, 0 changer transitions 0/60 dead transitions. [2025-02-08 08:13:06,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 210 flow [2025-02-08 08:13:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2025-02-08 08:13:06,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-08 08:13:06,889 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 178 flow. Second operand 2 states and 100 transitions. [2025-02-08 08:13:06,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 210 flow [2025-02-08 08:13:06,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 204 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:06,892 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 142 flow [2025-02-08 08:13:06,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=142, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-02-08 08:13:06,893 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2025-02-08 08:13:06,893 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 142 flow [2025-02-08 08:13:06,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:06,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:06,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:06,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:13:06,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 08:13:06,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:06,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1912106317, now seen corresponding path program 1 times [2025-02-08 08:13:06,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:06,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955907213] [2025-02-08 08:13:06,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:06,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:06,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:13:06,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:13:06,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:06,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:06,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955907213] [2025-02-08 08:13:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955907213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:06,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:06,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:13:06,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575972928] [2025-02-08 08:13:06,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:06,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:13:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:06,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:13:06,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:13:06,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2025-02-08 08:13:06,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:06,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:06,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2025-02-08 08:13:06,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:09,795 INFO L124 PetriNetUnfolderBase]: 48354/67034 cut-off events. [2025-02-08 08:13:09,796 INFO L125 PetriNetUnfolderBase]: For 2519/2519 co-relation queries the response was YES. [2025-02-08 08:13:09,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132718 conditions, 67034 events. 48354/67034 cut-off events. For 2519/2519 co-relation queries the response was YES. Maximal size of possible extension queue 2699. Compared 472137 event pairs, 10120 based on Foata normal form. 0/63121 useless extension candidates. Maximal degree in co-relation 132711. Up to 24865 conditions per place. [2025-02-08 08:13:10,125 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 80 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2025-02-08 08:13:10,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 105 transitions, 428 flow [2025-02-08 08:13:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:13:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:13:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2025-02-08 08:13:10,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-02-08 08:13:10,127 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 142 flow. Second operand 4 states and 184 transitions. [2025-02-08 08:13:10,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 105 transitions, 428 flow [2025-02-08 08:13:10,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 105 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:10,130 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 142 flow [2025-02-08 08:13:10,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2025-02-08 08:13:10,131 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2025-02-08 08:13:10,131 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 142 flow [2025-02-08 08:13:10,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:10,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:10,131 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:10,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:13:10,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 08:13:10,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash 793521405, now seen corresponding path program 1 times [2025-02-08 08:13:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:10,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299117770] [2025-02-08 08:13:10,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:10,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:10,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:13:10,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:13:10,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:10,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299117770] [2025-02-08 08:13:10,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299117770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:10,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:10,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:13:10,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530367645] [2025-02-08 08:13:10,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:10,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:13:10,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:10,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:13:10,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:13:10,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2025-02-08 08:13:10,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:10,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:10,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2025-02-08 08:13:10,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:13,372 INFO L124 PetriNetUnfolderBase]: 55559/76927 cut-off events. [2025-02-08 08:13:13,372 INFO L125 PetriNetUnfolderBase]: For 5129/5129 co-relation queries the response was YES. [2025-02-08 08:13:13,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154488 conditions, 76927 events. 55559/76927 cut-off events. For 5129/5129 co-relation queries the response was YES. Maximal size of possible extension queue 3105. Compared 546744 event pairs, 11653 based on Foata normal form. 0/70282 useless extension candidates. Maximal degree in co-relation 154480. Up to 28505 conditions per place. [2025-02-08 08:13:13,979 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 75 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2025-02-08 08:13:13,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 404 flow [2025-02-08 08:13:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:13:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:13:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-02-08 08:13:13,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5966666666666667 [2025-02-08 08:13:13,982 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 142 flow. Second operand 4 states and 179 transitions. [2025-02-08 08:13:13,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 404 flow [2025-02-08 08:13:13,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:13:13,994 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 138 flow [2025-02-08 08:13:13,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-02-08 08:13:13,995 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2025-02-08 08:13:13,995 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 138 flow [2025-02-08 08:13:13,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:13,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:13,995 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:13,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:13:13,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 08:13:13,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1464418952, now seen corresponding path program 1 times [2025-02-08 08:13:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:13,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368121180] [2025-02-08 08:13:13,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:14,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:13:14,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:13:14,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:14,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:14,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:14,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:13:14,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:13:14,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:14,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:14,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:14,011 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:14,011 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-08 08:13:14,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:13:14,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:13:14,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-02-08 08:13:14,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-02-08 08:13:14,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-08 08:13:14,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:13:14,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:13:14,012 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 08:13:14,012 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:14,012 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-08 08:13:14,041 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:14,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 92 transitions, 224 flow [2025-02-08 08:13:14,054 INFO L124 PetriNetUnfolderBase]: 15/116 cut-off events. [2025-02-08 08:13:14,054 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 08:13:14,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 116 events. 15/116 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 405 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 112. Up to 6 conditions per place. [2025-02-08 08:13:14,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 92 transitions, 224 flow [2025-02-08 08:13:14,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 92 transitions, 224 flow [2025-02-08 08:13:14,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:14,057 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;@32a115f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:14,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 08:13:14,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:14,058 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:13:14,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:14,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:14,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:13:14,058 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)] === [2025-02-08 08:13:14,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 424307, now seen corresponding path program 1 times [2025-02-08 08:13:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:14,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198423332] [2025-02-08 08:13:14,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:14,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:14,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:13:14,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:13:14,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:14,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198423332] [2025-02-08 08:13:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198423332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:14,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:14,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:14,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064850554] [2025-02-08 08:13:14,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:14,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:14,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:14,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:14,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 92 [2025-02-08 08:13:14,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:14,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:14,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 92 [2025-02-08 08:13:14,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand