./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i --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/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i -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 4a65477eb93c2031bed3e6d454d38e75e9833f23496d456d5084dd6ae5f38687 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:25:07,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:25:07,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:25:07,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:25:07,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:25:07,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:25:07,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:25:07,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:25:07,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:25:07,936 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:25:07,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:25:07,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:25:07,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:25:07,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:25:07,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:25:07,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:25:07,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:25:07,938 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:25:07,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:25:07,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:25:07,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:25:07,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:25:07,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:25:07,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:25:07,940 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:25:07,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:25:07,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:25:07,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:25:07,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:25:07,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:25:07,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:25:07,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:25:07,941 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 -> 4a65477eb93c2031bed3e6d454d38e75e9833f23496d456d5084dd6ae5f38687 [2025-03-08 17:25:08,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:25:08,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:25:08,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:25:08,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:25:08,149 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:25:08,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i [2025-03-08 17:25:09,253 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb195765a/fabf66438cbc40fa8470a42116d48bd7/FLAG44815b79d [2025-03-08 17:25:09,524 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:25:09,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i [2025-03-08 17:25:09,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb195765a/fabf66438cbc40fa8470a42116d48bd7/FLAG44815b79d [2025-03-08 17:25:09,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb195765a/fabf66438cbc40fa8470a42116d48bd7 [2025-03-08 17:25:09,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:25:09,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:25:09,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:25:09,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:25:09,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:25:09,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:09" (1/1) ... [2025-03-08 17:25:09,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a825b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:09, skipping insertion in model container [2025-03-08 17:25:09,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:09" (1/1) ... [2025-03-08 17:25:09,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:25:09,941 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/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i[1107,1120] [2025-03-08 17:25:10,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:25:10,041 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:25:10,048 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/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i[1107,1120] [2025-03-08 17:25:10,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:25:10,116 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:25:10,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10 WrapperNode [2025-03-08 17:25:10,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:25:10,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:25:10,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:25:10,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:25:10,123 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:25:10" (1/1) ... [2025-03-08 17:25:10,135 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:25:10" (1/1) ... [2025-03-08 17:25:10,152 INFO L138 Inliner]: procedures = 165, calls = 23, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2025-03-08 17:25:10,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:25:10,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:25:10,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:25:10,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:25:10,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,175 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-08 17:25:10,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:25:10,187 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:25:10,187 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:25:10,187 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:25:10,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:25:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:25:10,216 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:25:10,218 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:25:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-08 17:25:10,235 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-08 17:25:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:25:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:25:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:25:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:25:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:25:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:25:10,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:25:10,236 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:25:10,335 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:25:10,336 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:25:10,486 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:25:10,486 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:25:10,579 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:25:10,580 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:25:10,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:10 BoogieIcfgContainer [2025-03-08 17:25:10,580 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:25:10,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:25:10,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:25:10,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:25:10,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:25:09" (1/3) ... [2025-03-08 17:25:10,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15745908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:10, skipping insertion in model container [2025-03-08 17:25:10,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (2/3) ... [2025-03-08 17:25:10,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15745908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:10, skipping insertion in model container [2025-03-08 17:25:10,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:10" (3/3) ... [2025-03-08 17:25:10,588 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_69-refine-protected-loop-interval_true.i [2025-03-08 17:25:10,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:25:10,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_69-refine-protected-loop-interval_true.i that has 2 procedures, 29 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-08 17:25:10,599 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:25:10,633 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:25:10,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 34 transitions, 72 flow [2025-03-08 17:25:10,677 INFO L124 PetriNetUnfolderBase]: 6/33 cut-off events. [2025-03-08 17:25:10,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:25:10,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 33 events. 6/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-03-08 17:25:10,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 34 transitions, 72 flow [2025-03-08 17:25:10,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 33 transitions, 69 flow [2025-03-08 17:25:10,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:25:10,696 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;@1f18551c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:25:10,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-08 17:25:10,702 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:25:10,702 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-03-08 17:25:10,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:25:10,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:10,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:10,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:10,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1241893798, now seen corresponding path program 1 times [2025-03-08 17:25:10,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:10,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696923187] [2025-03-08 17:25:10,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:10,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:25:10,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:25:10,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:10,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:10,910 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:25:10,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:10,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696923187] [2025-03-08 17:25:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696923187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:10,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:10,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:25:10,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815039828] [2025-03-08 17:25:10,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:10,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:25:10,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:10,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:25:10,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:25:10,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-08 17:25:10,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:25:10,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:10,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-08 17:25:10,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:11,040 INFO L124 PetriNetUnfolderBase]: 106/237 cut-off events. [2025-03-08 17:25:11,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:25:11,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 237 events. 106/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 876 event pairs, 42 based on Foata normal form. 15/211 useless extension candidates. Maximal degree in co-relation 422. Up to 151 conditions per place. [2025-03-08 17:25:11,044 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 25 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-03-08 17:25:11,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 133 flow [2025-03-08 17:25:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:25:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:25:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-08 17:25:11,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-03-08 17:25:11,055 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 69 flow. Second operand 3 states and 69 transitions. [2025-03-08 17:25:11,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 133 flow [2025-03-08 17:25:11,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:25:11,062 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 74 flow [2025-03-08 17:25:11,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2025-03-08 17:25:11,065 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2025-03-08 17:25:11,066 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 74 flow [2025-03-08 17:25:11,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:25:11,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:11,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:11,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:25:11,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:11,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1241894824, now seen corresponding path program 1 times [2025-03-08 17:25:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:11,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502820414] [2025-03-08 17:25:11,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:11,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:11,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:25:11,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:25:11,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:11,186 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:25:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:11,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502820414] [2025-03-08 17:25:11,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502820414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:11,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:11,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:25:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200819795] [2025-03-08 17:25:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:11,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:25:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:11,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:25:11,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:25:11,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-08 17:25:11,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:25:11,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:11,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-08 17:25:11,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:11,316 INFO L124 PetriNetUnfolderBase]: 135/274 cut-off events. [2025-03-08 17:25:11,316 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-08 17:25:11,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 274 events. 135/274 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 946 event pairs, 43 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 556. Up to 144 conditions per place. [2025-03-08 17:25:11,317 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 32 selfloop transitions, 9 changer transitions 2/49 dead transitions. [2025-03-08 17:25:11,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 201 flow [2025-03-08 17:25:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:25:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:25:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-03-08 17:25:11,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2025-03-08 17:25:11,318 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 74 flow. Second operand 5 states and 86 transitions. [2025-03-08 17:25:11,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 201 flow [2025-03-08 17:25:11,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:25:11,320 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 122 flow [2025-03-08 17:25:11,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-03-08 17:25:11,320 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2025-03-08 17:25:11,320 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 122 flow [2025-03-08 17:25:11,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:25:11,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:11,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:11,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:25:11,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:11,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:11,321 INFO L85 PathProgramCache]: Analyzing trace with hash -601426353, now seen corresponding path program 1 times [2025-03-08 17:25:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:11,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759431197] [2025-03-08 17:25:11,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:11,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:11,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 17:25:11,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 17:25:11,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:11,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:11,437 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:25:11,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759431197] [2025-03-08 17:25:11,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759431197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:11,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:11,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:25:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837576481] [2025-03-08 17:25:11,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:11,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:25:11,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:11,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:25:11,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:25:11,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-08 17:25:11,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:25:11,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:11,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-08 17:25:11,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:11,516 INFO L124 PetriNetUnfolderBase]: 106/250 cut-off events. [2025-03-08 17:25:11,517 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2025-03-08 17:25:11,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 250 events. 106/250 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 801 event pairs, 22 based on Foata normal form. 12/242 useless extension candidates. Maximal degree in co-relation 626. Up to 89 conditions per place. [2025-03-08 17:25:11,520 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 31 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2025-03-08 17:25:11,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 232 flow [2025-03-08 17:25:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:25:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:25:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-03-08 17:25:11,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2025-03-08 17:25:11,522 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 122 flow. Second operand 4 states and 82 transitions. [2025-03-08 17:25:11,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 232 flow [2025-03-08 17:25:11,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:25:11,524 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 142 flow [2025-03-08 17:25:11,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2025-03-08 17:25:11,527 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2025-03-08 17:25:11,527 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 142 flow [2025-03-08 17:25:11,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:25:11,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:11,528 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:11,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:25:11,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:11,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash 48513867, now seen corresponding path program 1 times [2025-03-08 17:25:11,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:11,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187908667] [2025-03-08 17:25:11,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:11,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:25:11,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:25:11,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:11,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:25:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187908667] [2025-03-08 17:25:11,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187908667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:11,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:11,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:25:11,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679998878] [2025-03-08 17:25:11,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:11,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:25:11,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:11,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:25:11,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:25:11,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-08 17:25:11,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:25:11,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:11,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-08 17:25:11,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:11,661 INFO L124 PetriNetUnfolderBase]: 64/171 cut-off events. [2025-03-08 17:25:11,662 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-03-08 17:25:11,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 171 events. 64/171 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 503 event pairs, 16 based on Foata normal form. 13/168 useless extension candidates. Maximal degree in co-relation 421. Up to 89 conditions per place. [2025-03-08 17:25:11,663 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 21 selfloop transitions, 4 changer transitions 4/36 dead transitions. [2025-03-08 17:25:11,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 200 flow [2025-03-08 17:25:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:25:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:25:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-08 17:25:11,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-03-08 17:25:11,664 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 142 flow. Second operand 3 states and 62 transitions. [2025-03-08 17:25:11,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 200 flow [2025-03-08 17:25:11,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 188 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-08 17:25:11,666 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 112 flow [2025-03-08 17:25:11,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2025-03-08 17:25:11,667 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2025-03-08 17:25:11,667 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 112 flow [2025-03-08 17:25:11,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:25:11,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:11,667 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:11,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:25:11,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:11,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1655655635, now seen corresponding path program 1 times [2025-03-08 17:25:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:11,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673983692] [2025-03-08 17:25:11,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:11,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:25:11,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:25:11,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:11,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:25:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673983692] [2025-03-08 17:25:11,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673983692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:11,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:11,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:25:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460269977] [2025-03-08 17:25:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:11,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:25:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:11,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:25:11,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:25:11,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-08 17:25:11,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:25:11,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:11,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-08 17:25:11,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:11,898 INFO L124 PetriNetUnfolderBase]: 80/197 cut-off events. [2025-03-08 17:25:11,898 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-03-08 17:25:11,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 197 events. 80/197 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 573 event pairs, 26 based on Foata normal form. 8/184 useless extension candidates. Maximal degree in co-relation 507. Up to 74 conditions per place. [2025-03-08 17:25:11,899 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 0 selfloop transitions, 0 changer transitions 40/40 dead transitions. [2025-03-08 17:25:11,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 224 flow [2025-03-08 17:25:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:25:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:25:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2025-03-08 17:25:11,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3872549019607843 [2025-03-08 17:25:11,900 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 112 flow. Second operand 6 states and 79 transitions. [2025-03-08 17:25:11,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 224 flow [2025-03-08 17:25:11,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:25:11,902 INFO L231 Difference]: Finished difference. Result has 37 places, 0 transitions, 0 flow [2025-03-08 17:25:11,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=37, PETRI_TRANSITIONS=0} [2025-03-08 17:25:11,902 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2025-03-08 17:25:11,902 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 0 transitions, 0 flow [2025-03-08 17:25:11,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:25:11,904 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-08 17:25:11,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-08 17:25:11,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-08 17:25:11,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-08 17:25:11,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-08 17:25:11,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:25:11,906 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 17:25:11,910 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:25:11,910 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:25:11,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:25:11 BasicIcfg [2025-03-08 17:25:11,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:25:11,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:25:11,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:25:11,914 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:25:11,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:10" (3/4) ... [2025-03-08 17:25:11,916 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:25:11,918 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure worker [2025-03-08 17:25:11,920 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-03-08 17:25:11,921 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 17:25:11,921 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 17:25:11,921 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 17:25:11,921 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 17:25:11,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:25:11,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:25:11,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:25:11,972 INFO L158 Benchmark]: Toolchain (without parser) took 2159.61ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 95.6MB in the end (delta: 25.0MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2025-03-08 17:25:11,972 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:25:11,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.14ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 100.3MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 17:25:11,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.02ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 98.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:25:11,974 INFO L158 Benchmark]: Boogie Preprocessor took 34.03ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 97.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:25:11,974 INFO L158 Benchmark]: IcfgBuilder took 393.22ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 70.5MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 17:25:11,974 INFO L158 Benchmark]: TraceAbstraction took 1331.84ms. Allocated memory is still 167.8MB. Free memory was 69.6MB in the beginning and 100.8MB in the end (delta: -31.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:25:11,974 INFO L158 Benchmark]: Witness Printer took 56.78ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 95.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:25:11,976 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.41ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.14ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 100.3MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.02ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 98.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.03ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 97.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 393.22ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 70.5MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1331.84ms. Allocated memory is still 167.8MB. Free memory was 69.6MB in the beginning and 100.8MB in the end (delta: -31.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 56.78ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 95.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 3 procedures, 50 locations, 59 edges, 5 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: 1.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 279 IncrementalHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 6 mSDtfsCounter, 279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=3, InterpolantAutomatonStates: 21, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 17:25:11,990 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