./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-bluetooth.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-bluetooth.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cad856450cf6e95f9e7427e37ad4e3c8d32c703bbc90760a7f99cf9b3d00a8f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:20:29,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:20:29,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:20:29,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:20:29,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:20:29,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:20:29,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:20:29,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:20:29,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:20:29,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:20:29,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:20:29,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:20:29,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:20:29,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:20:29,783 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:20:29,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:20:29,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:20:29,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:20:29,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:20:29,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:20:29,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:20:29,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:20:29,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:20:29,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:20:29,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:20:29,785 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:20:29,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:20:29,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:20:29,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:20:29,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:20:29,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:20:29,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:20:29,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:20:29,786 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/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 ! call(reach_error())) ) 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 -> cad856450cf6e95f9e7427e37ad4e3c8d32c703bbc90760a7f99cf9b3d00a8f5 [2025-03-04 02:20:29,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:20:29,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:20:29,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:20:29,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:20:29,994 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:20:29,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-bluetooth.wvr.c [2025-03-04 02:20:31,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e372ace/36f676a829784ef4adcdacdfc99bb1df/FLAG9e52e4c51 [2025-03-04 02:20:31,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:20:31,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bluetooth.wvr.c [2025-03-04 02:20:31,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e372ace/36f676a829784ef4adcdacdfc99bb1df/FLAG9e52e4c51 [2025-03-04 02:20:31,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e372ace/36f676a829784ef4adcdacdfc99bb1df [2025-03-04 02:20:31,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:20:31,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:20:31,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:20:31,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:20:31,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:20:31,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef915b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31, skipping insertion in model container [2025-03-04 02:20:31,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:20:31,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bluetooth.wvr.c[2491,2504] [2025-03-04 02:20:31,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:20:31,506 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:20:31,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bluetooth.wvr.c[2491,2504] [2025-03-04 02:20:31,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:20:31,533 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:20:31,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31 WrapperNode [2025-03-04 02:20:31,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:20:31,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:20:31,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:20:31,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:20:31,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,566 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 113 [2025-03-04 02:20:31,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:20:31,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:20:31,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:20:31,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:20:31,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,592 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-03-04 02:20:31,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:20:31,606 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:20:31,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:20:31,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:20:31,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (1/1) ... [2025-03-04 02:20:31,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:20:31,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:31,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:20:31,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:20:31,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:20:31,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:20:31,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:20:31,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:20:31,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:20:31,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:20:31,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:20:31,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:20:31,661 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:20:31,714 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:20:31,715 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:20:31,868 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:20:31,868 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:20:31,968 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:20:31,969 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:20:31,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:31 BoogieIcfgContainer [2025-03-04 02:20:31,969 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:20:31,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:20:31,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:20:31,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:20:31,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:20:31" (1/3) ... [2025-03-04 02:20:31,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58078883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:20:31, skipping insertion in model container [2025-03-04 02:20:31,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:31" (2/3) ... [2025-03-04 02:20:31,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58078883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:20:31, skipping insertion in model container [2025-03-04 02:20:31,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:31" (3/3) ... [2025-03-04 02:20:31,977 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bluetooth.wvr.c [2025-03-04 02:20:31,988 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:20:31,989 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bluetooth.wvr.c that has 3 procedures, 45 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:20:31,989 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:20:32,031 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:20:32,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 108 flow [2025-03-04 02:20:32,089 INFO L124 PetriNetUnfolderBase]: 3/45 cut-off events. [2025-03-04 02:20:32,091 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:20:32,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 3/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-03-04 02:20:32,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 47 transitions, 108 flow [2025-03-04 02:20:32,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 44 transitions, 100 flow [2025-03-04 02:20:32,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:20:32,124 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=LoopHeads, 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;@72a513d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:20:32,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:20:32,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:20:32,138 INFO L124 PetriNetUnfolderBase]: 3/43 cut-off events. [2025-03-04 02:20:32,138 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:20:32,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:32,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:32,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:32,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:32,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1174907780, now seen corresponding path program 1 times [2025-03-04 02:20:32,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:32,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919287039] [2025-03-04 02:20:32,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:32,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:20:32,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:20:32,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:32,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:32,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:32,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919287039] [2025-03-04 02:20:32,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919287039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:32,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:32,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:20:32,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294121063] [2025-03-04 02:20:32,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:32,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:20:32,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:32,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:20:32,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:20:32,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2025-03-04 02:20:32,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03-04 02:20:32,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:32,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2025-03-04 02:20:32,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:32,589 INFO L124 PetriNetUnfolderBase]: 205/440 cut-off events. [2025-03-04 02:20:32,589 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-04 02:20:32,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 440 events. 205/440 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1919 event pairs, 73 based on Foata normal form. 12/425 useless extension candidates. Maximal degree in co-relation 739. Up to 223 conditions per place. [2025-03-04 02:20:32,593 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 42 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-03-04 02:20:32,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 228 flow [2025-03-04 02:20:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:20:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:20:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-04 02:20:32,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2025-03-04 02:20:32,604 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 100 flow. Second operand 3 states and 87 transitions. [2025-03-04 02:20:32,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 228 flow [2025-03-04 02:20:32,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:32,610 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 117 flow [2025-03-04 02:20:32,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2025-03-04 02:20:32,614 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2025-03-04 02:20:32,615 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 117 flow [2025-03-04 02:20:32,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03-04 02:20:32,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:32,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:32,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:20:32,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:32,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2118008035, now seen corresponding path program 1 times [2025-03-04 02:20:32,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:32,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932448424] [2025-03-04 02:20:32,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:32,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:20:32,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:20:32,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:32,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:32,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932448424] [2025-03-04 02:20:32,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932448424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:32,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:32,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:20:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745301600] [2025-03-04 02:20:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:32,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:20:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:32,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:20:32,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:20:32,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-03-04 02:20:32,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-04 02:20:32,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:32,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-03-04 02:20:32,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:32,835 INFO L124 PetriNetUnfolderBase]: 346/682 cut-off events. [2025-03-04 02:20:32,836 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-04 02:20:32,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 682 events. 346/682 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3135 event pairs, 104 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 693. Up to 448 conditions per place. [2025-03-04 02:20:32,841 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 51 selfloop transitions, 7 changer transitions 2/67 dead transitions. [2025-03-04 02:20:32,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 290 flow [2025-03-04 02:20:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:20:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:20:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-04 02:20:32,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2025-03-04 02:20:32,842 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 117 flow. Second operand 3 states and 87 transitions. [2025-03-04 02:20:32,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 290 flow [2025-03-04 02:20:32,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:32,844 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 153 flow [2025-03-04 02:20:32,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2025-03-04 02:20:32,845 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-03-04 02:20:32,845 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 153 flow [2025-03-04 02:20:32,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-04 02:20:32,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:32,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:32,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:20:32,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:32,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:32,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1676970579, now seen corresponding path program 2 times [2025-03-04 02:20:32,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:32,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054746473] [2025-03-04 02:20:32,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:32,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:32,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:20:32,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:20:32,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:32,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:33,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:33,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054746473] [2025-03-04 02:20:33,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054746473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:33,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:33,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:20:33,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674873632] [2025-03-04 02:20:33,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:33,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:20:33,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:33,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:20:33,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:20:33,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-03-04 02:20:33,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-03-04 02:20:33,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:33,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-03-04 02:20:33,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:33,254 INFO L124 PetriNetUnfolderBase]: 431/942 cut-off events. [2025-03-04 02:20:33,254 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2025-03-04 02:20:33,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 942 events. 431/942 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5160 event pairs, 42 based on Foata normal form. 47/983 useless extension candidates. Maximal degree in co-relation 1322. Up to 278 conditions per place. [2025-03-04 02:20:33,260 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 74 selfloop transitions, 18 changer transitions 11/110 dead transitions. [2025-03-04 02:20:33,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 555 flow [2025-03-04 02:20:33,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:20:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:20:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2025-03-04 02:20:33,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2025-03-04 02:20:33,263 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 153 flow. Second operand 6 states and 152 transitions. [2025-03-04 02:20:33,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 555 flow [2025-03-04 02:20:33,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 110 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:33,269 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 302 flow [2025-03-04 02:20:33,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2025-03-04 02:20:33,270 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2025-03-04 02:20:33,270 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 302 flow [2025-03-04 02:20:33,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-03-04 02:20:33,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:33,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:33,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:20:33,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:33,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:33,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2000862167, now seen corresponding path program 3 times [2025-03-04 02:20:33,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:33,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48957401] [2025-03-04 02:20:33,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:33,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:33,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:20:33,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:20:33,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:33,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:33,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:33,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48957401] [2025-03-04 02:20:33,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48957401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:33,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530895879] [2025-03-04 02:20:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:33,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:33,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:33,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:33,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2025-03-04 02:20:33,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 302 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-03-04 02:20:33,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:33,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2025-03-04 02:20:33,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:33,652 INFO L124 PetriNetUnfolderBase]: 342/868 cut-off events. [2025-03-04 02:20:33,652 INFO L125 PetriNetUnfolderBase]: For 870/876 co-relation queries the response was YES. [2025-03-04 02:20:33,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 868 events. 342/868 cut-off events. For 870/876 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5155 event pairs, 227 based on Foata normal form. 1/864 useless extension candidates. Maximal degree in co-relation 1722. Up to 495 conditions per place. [2025-03-04 02:20:33,660 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 47 selfloop transitions, 0 changer transitions 25/86 dead transitions. [2025-03-04 02:20:33,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 542 flow [2025-03-04 02:20:33,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-04 02:20:33,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2025-03-04 02:20:33,663 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 302 flow. Second operand 4 states and 104 transitions. [2025-03-04 02:20:33,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 542 flow [2025-03-04 02:20:33,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:20:33,672 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 296 flow [2025-03-04 02:20:33,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-03-04 02:20:33,673 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2025-03-04 02:20:33,673 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 296 flow [2025-03-04 02:20:33,673 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-03-04 02:20:33,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:33,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:33,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:20:33,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:33,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash 803488356, now seen corresponding path program 1 times [2025-03-04 02:20:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:33,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766460208] [2025-03-04 02:20:33,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:33,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:33,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 02:20:33,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:20:33,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:33,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:33,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766460208] [2025-03-04 02:20:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766460208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:33,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:33,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:20:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114437685] [2025-03-04 02:20:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:33,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:20:33,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:33,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:20:33,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:20:33,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-03-04 02:20:33,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-03-04 02:20:33,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:33,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-03-04 02:20:33,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:33,856 INFO L124 PetriNetUnfolderBase]: 334/743 cut-off events. [2025-03-04 02:20:33,856 INFO L125 PetriNetUnfolderBase]: For 1013/1013 co-relation queries the response was YES. [2025-03-04 02:20:33,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 743 events. 334/743 cut-off events. For 1013/1013 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3751 event pairs, 172 based on Foata normal form. 17/759 useless extension candidates. Maximal degree in co-relation 2096. Up to 441 conditions per place. [2025-03-04 02:20:33,861 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 61 selfloop transitions, 9 changer transitions 3/79 dead transitions. [2025-03-04 02:20:33,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 519 flow [2025-03-04 02:20:33,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:20:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:20:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-03-04 02:20:33,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2025-03-04 02:20:33,862 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 296 flow. Second operand 3 states and 85 transitions. [2025-03-04 02:20:33,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 519 flow [2025-03-04 02:20:33,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 505 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:33,866 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 340 flow [2025-03-04 02:20:33,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2025-03-04 02:20:33,867 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2025-03-04 02:20:33,867 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 340 flow [2025-03-04 02:20:33,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-03-04 02:20:33,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:33,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:33,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:20:33,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:33,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1818193390, now seen corresponding path program 2 times [2025-03-04 02:20:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84284778] [2025-03-04 02:20:33,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:33,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-03-04 02:20:33,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:20:33,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:33,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:33,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84284778] [2025-03-04 02:20:33,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84284778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:33,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:33,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:20:33,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542480771] [2025-03-04 02:20:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:33,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:20:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:33,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:20:33,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:20:33,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-03-04 02:20:33,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-03-04 02:20:33,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:33,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-03-04 02:20:33,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:34,101 INFO L124 PetriNetUnfolderBase]: 255/600 cut-off events. [2025-03-04 02:20:34,101 INFO L125 PetriNetUnfolderBase]: For 1130/1130 co-relation queries the response was YES. [2025-03-04 02:20:34,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 600 events. 255/600 cut-off events. For 1130/1130 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2892 event pairs, 30 based on Foata normal form. 11/608 useless extension candidates. Maximal degree in co-relation 1698. Up to 271 conditions per place. [2025-03-04 02:20:34,104 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 53 selfloop transitions, 19 changer transitions 11/89 dead transitions. [2025-03-04 02:20:34,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 586 flow [2025-03-04 02:20:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:20:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:20:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-04 02:20:34,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4574468085106383 [2025-03-04 02:20:34,105 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 340 flow. Second operand 6 states and 129 transitions. [2025-03-04 02:20:34,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 586 flow [2025-03-04 02:20:34,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 89 transitions, 553 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 02:20:34,109 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 363 flow [2025-03-04 02:20:34,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-03-04 02:20:34,110 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2025-03-04 02:20:34,110 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 363 flow [2025-03-04 02:20:34,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-03-04 02:20:34,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:34,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:34,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:20:34,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:34,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1045198122, now seen corresponding path program 1 times [2025-03-04 02:20:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:34,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357632584] [2025-03-04 02:20:34,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:34,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:34,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 02:20:34,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:20:34,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:34,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:34,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:34,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357632584] [2025-03-04 02:20:34,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357632584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:34,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:34,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:34,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544955335] [2025-03-04 02:20:34,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:34,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:34,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:34,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:34,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:34,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2025-03-04 02:20:34,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 363 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-03-04 02:20:34,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:34,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2025-03-04 02:20:34,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:34,296 INFO L124 PetriNetUnfolderBase]: 135/345 cut-off events. [2025-03-04 02:20:34,296 INFO L125 PetriNetUnfolderBase]: For 943/951 co-relation queries the response was YES. [2025-03-04 02:20:34,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 345 events. 135/345 cut-off events. For 943/951 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1407 event pairs, 47 based on Foata normal form. 5/345 useless extension candidates. Maximal degree in co-relation 1074. Up to 206 conditions per place. [2025-03-04 02:20:34,298 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 47 selfloop transitions, 8 changer transitions 2/65 dead transitions. [2025-03-04 02:20:34,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 465 flow [2025-03-04 02:20:34,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-03-04 02:20:34,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5053191489361702 [2025-03-04 02:20:34,300 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 363 flow. Second operand 4 states and 95 transitions. [2025-03-04 02:20:34,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 465 flow [2025-03-04 02:20:34,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 421 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:34,306 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 301 flow [2025-03-04 02:20:34,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-04 02:20:34,307 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2025-03-04 02:20:34,308 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 301 flow [2025-03-04 02:20:34,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-03-04 02:20:34,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:34,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:34,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:20:34,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:34,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1025722392, now seen corresponding path program 2 times [2025-03-04 02:20:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:34,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800562398] [2025-03-04 02:20:34,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:34,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-03-04 02:20:34,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:20:34,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:34,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800562398] [2025-03-04 02:20:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800562398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:34,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606826456] [2025-03-04 02:20:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:34,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:34,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:34,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:34,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2025-03-04 02:20:34,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-03-04 02:20:34,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:34,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2025-03-04 02:20:34,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:34,692 INFO L124 PetriNetUnfolderBase]: 128/340 cut-off events. [2025-03-04 02:20:34,693 INFO L125 PetriNetUnfolderBase]: For 598/600 co-relation queries the response was YES. [2025-03-04 02:20:34,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 340 events. 128/340 cut-off events. For 598/600 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1415 event pairs, 13 based on Foata normal form. 3/343 useless extension candidates. Maximal degree in co-relation 990. Up to 134 conditions per place. [2025-03-04 02:20:34,694 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 0 selfloop transitions, 0 changer transitions 77/77 dead transitions. [2025-03-04 02:20:34,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 540 flow [2025-03-04 02:20:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:20:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:20:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2025-03-04 02:20:34,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42249240121580545 [2025-03-04 02:20:34,698 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 301 flow. Second operand 7 states and 139 transitions. [2025-03-04 02:20:34,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 540 flow [2025-03-04 02:20:34,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 508 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 02:20:34,700 INFO L231 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2025-03-04 02:20:34,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2025-03-04 02:20:34,703 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2025-03-04 02:20:34,703 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2025-03-04 02:20:34,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-03-04 02:20:34,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-04 02:20:34,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-04 02:20:34,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-04 02:20:34,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:20:34,707 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1] [2025-03-04 02:20:34,710 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:20:34,710 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:20:34,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:20:34 BasicIcfg [2025-03-04 02:20:34,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:20:34,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:20:34,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:20:34,716 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:20:34,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:31" (3/4) ... [2025-03-04 02:20:34,719 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:20:34,721 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 02:20:34,721 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 02:20:34,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 02:20:34,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 02:20:34,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 02:20:34,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 02:20:34,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 02:20:34,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:20:34,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:20:34,776 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:20:34,776 INFO L158 Benchmark]: Toolchain (without parser) took 3418.71ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 110.8MB in the beginning and 144.9MB in the end (delta: -34.1MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2025-03-04 02:20:34,777 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:20:34,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.75ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 98.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:20:34,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.99ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:20:34,777 INFO L158 Benchmark]: Boogie Preprocessor took 38.77ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.9MB in the end (delta: 967.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:20:34,778 INFO L158 Benchmark]: IcfgBuilder took 362.92ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 65.9MB in the end (delta: 30.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:20:34,778 INFO L158 Benchmark]: TraceAbstraction took 2744.73ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 65.3MB in the beginning and 149.8MB in the end (delta: -84.5MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2025-03-04 02:20:34,778 INFO L158 Benchmark]: Witness Printer took 59.67ms. Allocated memory is still 310.4MB. Free memory was 149.8MB in the beginning and 144.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:20:34,780 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.75ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 98.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.99ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.77ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.9MB in the end (delta: 967.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 362.92ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 65.9MB in the end (delta: 30.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2744.73ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 65.3MB in the beginning and 149.8MB in the end (delta: -84.5MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. * Witness Printer took 59.67ms. Allocated memory is still 310.4MB. Free memory was 149.8MB in the beginning and 144.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 69 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 884 IncrementalHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 9 mSDtfsCounter, 884 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=363occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:20:34,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE