./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/chl-collitem-trans.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 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:29:19,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:29:19,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:29:19,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:29:19,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:29:19,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:29:19,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:29:19,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:29:19,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:29:19,631 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:29:19,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:29:19,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:29:19,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:29:19,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:29:19,632 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:29:19,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:29:19,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:29:19,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:29:19,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:29:19,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:29:19,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:29:19,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:29:19,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:29:19,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:29:19,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:29:19,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:29:19,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:29:19,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:29:19,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:29:19,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:29:19,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:29:19,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:29:19,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:29:19,635 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 -> 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab [2025-03-08 17:29:19,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:29:19,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:29:19,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:29:19,840 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:29:19,840 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:29:19,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2025-03-08 17:29:20,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96092dba6/ca10ae38fee744e381cb1acabde7661e/FLAG3359426cd [2025-03-08 17:29:21,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:29:21,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2025-03-08 17:29:21,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96092dba6/ca10ae38fee744e381cb1acabde7661e/FLAG3359426cd [2025-03-08 17:29:21,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96092dba6/ca10ae38fee744e381cb1acabde7661e [2025-03-08 17:29:21,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:29:21,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:29:21,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:29:21,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:29:21,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:29:21,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74781be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21, skipping insertion in model container [2025-03-08 17:29:21,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:29:21,657 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/chl-collitem-trans.wvr.c[3520,3533] [2025-03-08 17:29:21,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:29:21,670 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:29:21,686 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/chl-collitem-trans.wvr.c[3520,3533] [2025-03-08 17:29:21,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:29:21,696 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:29:21,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21 WrapperNode [2025-03-08 17:29:21,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:29:21,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:29:21,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:29:21,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:29:21,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,727 INFO L138 Inliner]: procedures = 22, calls = 30, calls flagged for inlining = 17, calls inlined = 39, statements flattened = 345 [2025-03-08 17:29:21,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:29:21,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:29:21,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:29:21,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:29:21,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,746 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-08 17:29:21,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:29:21,757 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:29:21,757 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:29:21,757 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:29:21,758 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 17:29:21,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:29:21,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:21,787 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-08 17:29:21,790 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-08 17:29:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:29:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:29:21,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:29:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:29:21,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:29:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:29:21,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:29:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:29:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:29:21,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:29:21,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:29:21,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:29:21,808 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:29:21,887 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:29:21,889 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:29:22,288 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:29:22,288 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:29:22,682 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:29:22,682 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:29:22,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:22 BoogieIcfgContainer [2025-03-08 17:29:22,682 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:29:22,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:29:22,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:29:22,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:29:22,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:21" (1/3) ... [2025-03-08 17:29:22,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22af1836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:22, skipping insertion in model container [2025-03-08 17:29:22,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (2/3) ... [2025-03-08 17:29:22,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22af1836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:22, skipping insertion in model container [2025-03-08 17:29:22,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:22" (3/3) ... [2025-03-08 17:29:22,690 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2025-03-08 17:29:22,701 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:29:22,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-trans.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 17:29:22,702 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:29:22,766 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:29:22,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 71 flow [2025-03-08 17:29:22,825 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-08 17:29:22,827 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:29:22,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-08 17:29:22,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 25 transitions, 71 flow [2025-03-08 17:29:22,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 21 transitions, 60 flow [2025-03-08 17:29:22,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:29:22,855 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;@7c6c1843, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:29:22,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:29:22,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:29:22,867 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-08 17:29:22,867 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:29:22,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:22,868 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] [2025-03-08 17:29:22,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:22,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1779723146, now seen corresponding path program 1 times [2025-03-08 17:29:22,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:22,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073407749] [2025-03-08 17:29:22,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:22,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:22,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:29:23,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:29:23,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:23,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:25,113 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-08 17:29:25,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073407749] [2025-03-08 17:29:25,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073407749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:25,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:25,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434756095] [2025-03-08 17:29:25,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:25,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:25,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:25,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:25,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:25,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-08 17:29:25,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:25,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:25,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-08 17:29:25,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:25,500 INFO L124 PetriNetUnfolderBase]: 178/331 cut-off events. [2025-03-08 17:29:25,501 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-08 17:29:25,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 331 events. 178/331 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1245 event pairs, 10 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 634. Up to 110 conditions per place. [2025-03-08 17:29:25,504 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 34 selfloop transitions, 6 changer transitions 8/52 dead transitions. [2025-03-08 17:29:25,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 248 flow [2025-03-08 17:29:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-03-08 17:29:25,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6066666666666667 [2025-03-08 17:29:25,517 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 60 flow. Second operand 6 states and 91 transitions. [2025-03-08 17:29:25,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 248 flow [2025-03-08 17:29:25,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:29:25,525 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 81 flow [2025-03-08 17:29:25,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-03-08 17:29:25,529 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-03-08 17:29:25,530 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 81 flow [2025-03-08 17:29:25,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:25,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:25,530 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] [2025-03-08 17:29:25,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:29:25,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:25,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:25,531 INFO L85 PathProgramCache]: Analyzing trace with hash -264221928, now seen corresponding path program 2 times [2025-03-08 17:29:25,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:25,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928421416] [2025-03-08 17:29:25,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:29:25,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:25,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:29:25,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:29:25,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:29:25,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:27,351 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-08 17:29:27,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928421416] [2025-03-08 17:29:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928421416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:27,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:27,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582901109] [2025-03-08 17:29:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:27,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:27,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:27,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-08 17:29:27,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:27,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:27,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-08 17:29:27,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:27,648 INFO L124 PetriNetUnfolderBase]: 194/366 cut-off events. [2025-03-08 17:29:27,648 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-03-08 17:29:27,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 366 events. 194/366 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1552 event pairs, 34 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 857. Up to 151 conditions per place. [2025-03-08 17:29:27,650 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 32 selfloop transitions, 7 changer transitions 6/49 dead transitions. [2025-03-08 17:29:27,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 49 transitions, 239 flow [2025-03-08 17:29:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:29:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:29:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-03-08 17:29:27,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.624 [2025-03-08 17:29:27,666 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 81 flow. Second operand 5 states and 78 transitions. [2025-03-08 17:29:27,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 49 transitions, 239 flow [2025-03-08 17:29:27,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 235 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 17:29:27,668 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 112 flow [2025-03-08 17:29:27,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2025-03-08 17:29:27,668 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2025-03-08 17:29:27,669 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 112 flow [2025-03-08 17:29:27,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:27,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:27,669 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] [2025-03-08 17:29:27,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:29:27,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:27,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash -344707472, now seen corresponding path program 3 times [2025-03-08 17:29:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022862739] [2025-03-08 17:29:27,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:29:27,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:27,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:29:27,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:29:27,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:29:27,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:28,975 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-08 17:29:28,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:28,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022862739] [2025-03-08 17:29:28,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022862739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:28,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:28,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960272278] [2025-03-08 17:29:28,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:28,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:28,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:28,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:28,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:28,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-08 17:29:28,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:28,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:28,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-08 17:29:28,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:29,259 INFO L124 PetriNetUnfolderBase]: 189/369 cut-off events. [2025-03-08 17:29:29,260 INFO L125 PetriNetUnfolderBase]: For 327/327 co-relation queries the response was YES. [2025-03-08 17:29:29,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 369 events. 189/369 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1521 event pairs, 16 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 267. Up to 190 conditions per place. [2025-03-08 17:29:29,264 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 31 selfloop transitions, 6 changer transitions 11/52 dead transitions. [2025-03-08 17:29:29,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 277 flow [2025-03-08 17:29:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-03-08 17:29:29,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-08 17:29:29,268 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 112 flow. Second operand 6 states and 90 transitions. [2025-03-08 17:29:29,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 277 flow [2025-03-08 17:29:29,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 259 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-08 17:29:29,270 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 107 flow [2025-03-08 17:29:29,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=107, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2025-03-08 17:29:29,270 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2025-03-08 17:29:29,270 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 107 flow [2025-03-08 17:29:29,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:29,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:29,272 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] [2025-03-08 17:29:29,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:29:29,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:29,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:29,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2050761064, now seen corresponding path program 4 times [2025-03-08 17:29:29,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:29,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495193140] [2025-03-08 17:29:29,273 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:29:29,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:29,291 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-08 17:29:29,324 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:29:29,325 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:29:29,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:30,455 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-08 17:29:30,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:30,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495193140] [2025-03-08 17:29:30,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495193140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:30,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:30,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609562762] [2025-03-08 17:29:30,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:30,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:30,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:30,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:30,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:30,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-08 17:29:30,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:30,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:30,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-08 17:29:30,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:30,753 INFO L124 PetriNetUnfolderBase]: 138/270 cut-off events. [2025-03-08 17:29:30,753 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2025-03-08 17:29:30,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 270 events. 138/270 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 998 event pairs, 9 based on Foata normal form. 1/271 useless extension candidates. Maximal degree in co-relation 698. Up to 93 conditions per place. [2025-03-08 17:29:30,755 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 30 selfloop transitions, 5 changer transitions 11/50 dead transitions. [2025-03-08 17:29:30,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 266 flow [2025-03-08 17:29:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-08 17:29:30,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2025-03-08 17:29:30,758 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 107 flow. Second operand 6 states and 88 transitions. [2025-03-08 17:29:30,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 266 flow [2025-03-08 17:29:30,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 249 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-08 17:29:30,761 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 102 flow [2025-03-08 17:29:30,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2025-03-08 17:29:30,762 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-03-08 17:29:30,763 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 102 flow [2025-03-08 17:29:30,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:30,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:30,763 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] [2025-03-08 17:29:30,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:29:30,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:30,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 277489050, now seen corresponding path program 5 times [2025-03-08 17:29:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484234762] [2025-03-08 17:29:30,764 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:29:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:30,777 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:29:30,812 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:29:30,812 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:29:30,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:31,852 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-08 17:29:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:31,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484234762] [2025-03-08 17:29:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484234762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:31,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:31,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556626330] [2025-03-08 17:29:31,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:31,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:31,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:31,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:31,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:31,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-08 17:29:31,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 24 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:31,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:31,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-08 17:29:31,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:32,042 INFO L124 PetriNetUnfolderBase]: 85/173 cut-off events. [2025-03-08 17:29:32,043 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2025-03-08 17:29:32,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 173 events. 85/173 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 535 event pairs, 5 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 455. Up to 69 conditions per place. [2025-03-08 17:29:32,045 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 19 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2025-03-08 17:29:32,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 215 flow [2025-03-08 17:29:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2025-03-08 17:29:32,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-08 17:29:32,048 INFO L175 Difference]: Start difference. First operand has 43 places, 24 transitions, 102 flow. Second operand 6 states and 80 transitions. [2025-03-08 17:29:32,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 215 flow [2025-03-08 17:29:32,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 204 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-08 17:29:32,050 INFO L231 Difference]: Finished difference. Result has 43 places, 21 transitions, 76 flow [2025-03-08 17:29:32,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=21} [2025-03-08 17:29:32,050 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-03-08 17:29:32,050 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 21 transitions, 76 flow [2025-03-08 17:29:32,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:32,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:32,051 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] [2025-03-08 17:29:32,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:29:32,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:29:32,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:32,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2110045572, now seen corresponding path program 6 times [2025-03-08 17:29:32,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:32,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804660131] [2025-03-08 17:29:32,052 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:29:32,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:32,064 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:29:32,088 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:29:32,088 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:29:32,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:33,140 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-08 17:29:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:33,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804660131] [2025-03-08 17:29:33,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804660131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:33,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:33,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321432242] [2025-03-08 17:29:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:33,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:33,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:33,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:33,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-08 17:29:33,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 21 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:33,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:33,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-08 17:29:33,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:33,382 INFO L124 PetriNetUnfolderBase]: 42/89 cut-off events. [2025-03-08 17:29:33,382 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-03-08 17:29:33,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 89 events. 42/89 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 187 event pairs, 0 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 239. Up to 54 conditions per place. [2025-03-08 17:29:33,383 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2025-03-08 17:29:33,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 26 transitions, 131 flow [2025-03-08 17:29:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-03-08 17:29:33,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44 [2025-03-08 17:29:33,384 INFO L175 Difference]: Start difference. First operand has 43 places, 21 transitions, 76 flow. Second operand 6 states and 66 transitions. [2025-03-08 17:29:33,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 26 transitions, 131 flow [2025-03-08 17:29:33,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 115 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-08 17:29:33,385 INFO L231 Difference]: Finished difference. Result has 36 places, 0 transitions, 0 flow [2025-03-08 17:29:33,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=36, PETRI_TRANSITIONS=0} [2025-03-08 17:29:33,385 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2025-03-08 17:29:33,385 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 0 transitions, 0 flow [2025-03-08 17:29:33,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08 17:29:33,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-08 17:29:33,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-08 17:29:33,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-08 17:29:33,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-08 17:29:33,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:29:33,389 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-03-08 17:29:33,392 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:29:33,392 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:29:33,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:29:33 BasicIcfg [2025-03-08 17:29:33,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:29:33,399 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:29:33,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:29:33,399 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:29:33,400 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:22" (3/4) ... [2025-03-08 17:29:33,402 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:29:33,404 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 17:29:33,404 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 17:29:33,404 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 17:29:33,409 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2025-03-08 17:29:33,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-03-08 17:29:33,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-08 17:29:33,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 17:29:33,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 17:29:33,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:29:33,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:29:33,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:29:33,477 INFO L158 Benchmark]: Toolchain (without parser) took 11966.18ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 105.0MB in the beginning and 612.0MB in the end (delta: -506.9MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2025-03-08 17:29:33,477 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:29:33,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.73ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:29:33,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.25ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:29:33,477 INFO L158 Benchmark]: Boogie Preprocessor took 29.16ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:29:33,478 INFO L158 Benchmark]: IcfgBuilder took 925.45ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 91.1MB in the end (delta: -3.5MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2025-03-08 17:29:33,478 INFO L158 Benchmark]: TraceAbstraction took 10714.01ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 91.1MB in the beginning and 616.1MB in the end (delta: -525.0MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2025-03-08 17:29:33,478 INFO L158 Benchmark]: Witness Printer took 77.30ms. Allocated memory is still 721.4MB. Free memory was 616.1MB in the beginning and 612.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:29:33,479 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.73ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.25ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.16ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 925.45ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 91.1MB in the end (delta: -3.5MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10714.01ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 91.1MB in the beginning and 616.1MB in the end (delta: -525.0MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Witness Printer took 77.30ms. Allocated memory is still 721.4MB. Free memory was 616.1MB in the beginning and 612.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: 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 7 procedures, 41 locations, 40 edges, 4 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: 10.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 480 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 480 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=2, InterpolantAutomatonStates: 35, 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.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 3756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-08 17:29:33,493 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