./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-3.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 11bff6cd42e59c1eface46e47cb7e4e4f51a04703472e58b1bb7c25b58842408 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:45:35,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:45:35,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:45:35,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:45:35,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:45:36,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:45:36,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:45:36,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:45:36,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:45:36,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:45:36,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:45:36,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:45:36,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:45:36,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:45:36,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:45:36,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:45:36,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:45:36,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:45:36,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:45:36,011 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 -> 11bff6cd42e59c1eface46e47cb7e4e4f51a04703472e58b1bb7c25b58842408 [2025-03-13 21:45:36,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:45:36,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:45:36,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:45:36,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:45:36,242 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:45:36,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2025-03-13 21:45:37,403 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ba3db15/77ad2c7375ec4daa850b31ac4d0dad2c/FLAG0cabef865 [2025-03-13 21:45:37,684 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:45:37,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2025-03-13 21:45:37,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ba3db15/77ad2c7375ec4daa850b31ac4d0dad2c/FLAG0cabef865 [2025-03-13 21:45:37,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ba3db15/77ad2c7375ec4daa850b31ac4d0dad2c [2025-03-13 21:45:37,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:45:37,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:45:37,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:45:37,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:45:37,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:45:37,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f71bccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37, skipping insertion in model container [2025-03-13 21:45:37,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:45:37,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c[2331,2344] [2025-03-13 21:45:37,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:45:37,876 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:45:37,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c[2331,2344] [2025-03-13 21:45:37,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:45:37,911 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:45:37,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37 WrapperNode [2025-03-13 21:45:37,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:45:37,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:45:37,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:45:37,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:45:37,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,940 INFO L138 Inliner]: procedures = 19, calls = 14, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 140 [2025-03-13 21:45:37,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:45:37,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:45:37,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:45:37,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:45:37,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,965 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-13 21:45:37,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:45:37,974 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:45:37,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:45:37,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:45:37,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (1/1) ... [2025-03-13 21:45:37,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:45:37,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:37,998 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-13 21:45:38,000 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-13 21:45:38,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:45:38,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:45:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:45:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:45:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:45:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:45:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:45:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:45:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:45:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:45:38,017 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:45:38,091 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:45:38,092 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:45:38,271 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:45:38,272 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:45:38,272 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:45:38,393 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:45:38,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:45:38 BoogieIcfgContainer [2025-03-13 21:45:38,393 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:45:38,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:45:38,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:45:38,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:45:38,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:45:37" (1/3) ... [2025-03-13 21:45:38,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705b99b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:45:38, skipping insertion in model container [2025-03-13 21:45:38,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:37" (2/3) ... [2025-03-13 21:45:38,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705b99b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:45:38, skipping insertion in model container [2025-03-13 21:45:38,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:45:38" (3/3) ... [2025-03-13 21:45:38,401 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2025-03-13 21:45:38,410 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:45:38,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-3.wvr.c that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-13 21:45:38,411 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:45:38,451 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:45:38,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 115 flow [2025-03-13 21:45:38,508 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2025-03-13 21:45:38,512 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:45:38,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 2/44 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-03-13 21:45:38,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 115 flow [2025-03-13 21:45:38,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 104 flow [2025-03-13 21:45:38,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:45:38,535 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;@b9ce654, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:45:38,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:45:38,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:45:38,551 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-13 21:45:38,551 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:45:38,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:38,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:38,552 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-13 21:45:38,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:38,556 INFO L85 PathProgramCache]: Analyzing trace with hash 632659640, now seen corresponding path program 1 times [2025-03-13 21:45:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:38,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697171894] [2025-03-13 21:45:38,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:38,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:45:38,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:45:38,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:38,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:38,854 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-13 21:45:38,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697171894] [2025-03-13 21:45:38,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697171894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:38,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:38,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:45:38,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567738442] [2025-03-13 21:45:38,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:38,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:45:38,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:38,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:45:38,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:45:38,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2025-03-13 21:45:38,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-13 21:45:38,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:38,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2025-03-13 21:45:38,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:39,234 INFO L124 PetriNetUnfolderBase]: 1948/3061 cut-off events. [2025-03-13 21:45:39,234 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-13 21:45:39,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6136 conditions, 3061 events. 1948/3061 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16388 event pairs, 858 based on Foata normal form. 1/2959 useless extension candidates. Maximal degree in co-relation 5693. Up to 1547 conditions per place. [2025-03-13 21:45:39,257 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 51 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2025-03-13 21:45:39,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 274 flow [2025-03-13 21:45:39,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:45:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:45:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-13 21:45:39,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6453900709219859 [2025-03-13 21:45:39,270 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 104 flow. Second operand 3 states and 91 transitions. [2025-03-13 21:45:39,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 274 flow [2025-03-13 21:45:39,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 254 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:45:39,283 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 117 flow [2025-03-13 21:45:39,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-03-13 21:45:39,289 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-13 21:45:39,290 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 117 flow [2025-03-13 21:45:39,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-13 21:45:39,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:39,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:39,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:45:39,292 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-13 21:45:39,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:39,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1898157518, now seen corresponding path program 1 times [2025-03-13 21:45:39,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:39,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696722815] [2025-03-13 21:45:39,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:39,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:39,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:45:39,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:39,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:39,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:39,358 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-13 21:45:39,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:39,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696722815] [2025-03-13 21:45:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696722815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:39,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:45:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493036491] [2025-03-13 21:45:39,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:39,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:45:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:39,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:45:39,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:45:39,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2025-03-13 21:45:39,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-13 21:45:39,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:39,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2025-03-13 21:45:39,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:39,616 INFO L124 PetriNetUnfolderBase]: 2293/3505 cut-off events. [2025-03-13 21:45:39,618 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2025-03-13 21:45:39,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7425 conditions, 3505 events. 2293/3505 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 17786 event pairs, 1673 based on Foata normal form. 0/3460 useless extension candidates. Maximal degree in co-relation 4808. Up to 3012 conditions per place. [2025-03-13 21:45:39,650 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 54 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-03-13 21:45:39,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 291 flow [2025-03-13 21:45:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:45:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:45:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-13 21:45:39,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5673758865248227 [2025-03-13 21:45:39,653 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 117 flow. Second operand 3 states and 80 transitions. [2025-03-13 21:45:39,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 291 flow [2025-03-13 21:45:39,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:39,656 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 156 flow [2025-03-13 21:45:39,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-03-13 21:45:39,657 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2025-03-13 21:45:39,657 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 156 flow [2025-03-13 21:45:39,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-13 21:45:39,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:39,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:39,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:45:39,658 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-13 21:45:39,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1930786932, now seen corresponding path program 1 times [2025-03-13 21:45:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:39,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916196142] [2025-03-13 21:45:39,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:39,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:45:39,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:39,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:39,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:39,826 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-13 21:45:39,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:39,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916196142] [2025-03-13 21:45:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916196142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:39,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:39,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:45:39,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195958697] [2025-03-13 21:45:39,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:39,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:45:39,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:39,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:45:39,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:45:39,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2025-03-13 21:45:39,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-13 21:45:39,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:39,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2025-03-13 21:45:39,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:40,220 INFO L124 PetriNetUnfolderBase]: 2768/4506 cut-off events. [2025-03-13 21:45:40,220 INFO L125 PetriNetUnfolderBase]: For 1505/1509 co-relation queries the response was YES. [2025-03-13 21:45:40,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10349 conditions, 4506 events. 2768/4506 cut-off events. For 1505/1509 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 26697 event pairs, 604 based on Foata normal form. 26/4464 useless extension candidates. Maximal degree in co-relation 6384. Up to 1835 conditions per place. [2025-03-13 21:45:40,236 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 80 selfloop transitions, 21 changer transitions 3/114 dead transitions. [2025-03-13 21:45:40,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 114 transitions, 555 flow [2025-03-13 21:45:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:45:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:45:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2025-03-13 21:45:40,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5709219858156028 [2025-03-13 21:45:40,242 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 156 flow. Second operand 6 states and 161 transitions. [2025-03-13 21:45:40,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 114 transitions, 555 flow [2025-03-13 21:45:40,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 114 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:45:40,248 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 221 flow [2025-03-13 21:45:40,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2025-03-13 21:45:40,249 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2025-03-13 21:45:40,249 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 221 flow [2025-03-13 21:45:40,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-13 21:45:40,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:40,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:40,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:45:40,250 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-13 21:45:40,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1191298344, now seen corresponding path program 2 times [2025-03-13 21:45:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936230762] [2025-03-13 21:45:40,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:40,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:40,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:45:40,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:40,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:45:40,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:40,403 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-13 21:45:40,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:40,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936230762] [2025-03-13 21:45:40,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936230762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:40,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:40,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:45:40,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704150962] [2025-03-13 21:45:40,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:40,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:40,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:40,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:40,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:40,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2025-03-13 21:45:40,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-13 21:45:40,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:40,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2025-03-13 21:45:40,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:40,803 INFO L124 PetriNetUnfolderBase]: 3433/5678 cut-off events. [2025-03-13 21:45:40,803 INFO L125 PetriNetUnfolderBase]: For 2124/2132 co-relation queries the response was YES. [2025-03-13 21:45:40,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14048 conditions, 5678 events. 3433/5678 cut-off events. For 2124/2132 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 35909 event pairs, 926 based on Foata normal form. 62/5642 useless extension candidates. Maximal degree in co-relation 9317. Up to 1972 conditions per place. [2025-03-13 21:45:40,823 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 83 selfloop transitions, 23 changer transitions 11/127 dead transitions. [2025-03-13 21:45:40,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 666 flow [2025-03-13 21:45:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2025-03-13 21:45:40,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6340425531914894 [2025-03-13 21:45:40,824 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 221 flow. Second operand 5 states and 149 transitions. [2025-03-13 21:45:40,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 666 flow [2025-03-13 21:45:40,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 127 transitions, 660 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:40,828 INFO L231 Difference]: Finished difference. Result has 60 places, 73 transitions, 346 flow [2025-03-13 21:45:40,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=60, PETRI_TRANSITIONS=73} [2025-03-13 21:45:40,829 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-03-13 21:45:40,829 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 73 transitions, 346 flow [2025-03-13 21:45:40,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-13 21:45:40,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:40,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:40,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:45:40,829 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-13 21:45:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2036542814, now seen corresponding path program 2 times [2025-03-13 21:45:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222884388] [2025-03-13 21:45:40,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:40,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:40,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:45:40,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:40,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:45:40,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:40,983 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-13 21:45:40,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:40,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222884388] [2025-03-13 21:45:40,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222884388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:40,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:40,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:45:40,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269596974] [2025-03-13 21:45:40,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:40,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:40,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:40,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:40,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2025-03-13 21:45:40,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 73 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-13 21:45:40,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:40,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2025-03-13 21:45:40,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:41,717 INFO L124 PetriNetUnfolderBase]: 2839/4796 cut-off events. [2025-03-13 21:45:41,718 INFO L125 PetriNetUnfolderBase]: For 4790/4790 co-relation queries the response was YES. [2025-03-13 21:45:41,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13511 conditions, 4796 events. 2839/4796 cut-off events. For 4790/4790 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 29996 event pairs, 785 based on Foata normal form. 78/4813 useless extension candidates. Maximal degree in co-relation 8773. Up to 1604 conditions per place. [2025-03-13 21:45:41,738 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 80 selfloop transitions, 24 changer transitions 12/126 dead transitions. [2025-03-13 21:45:41,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 126 transitions, 770 flow [2025-03-13 21:45:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-03-13 21:45:41,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212765957446809 [2025-03-13 21:45:41,741 INFO L175 Difference]: Start difference. First operand has 60 places, 73 transitions, 346 flow. Second operand 5 states and 146 transitions. [2025-03-13 21:45:41,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 126 transitions, 770 flow [2025-03-13 21:45:41,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 126 transitions, 757 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:41,747 INFO L231 Difference]: Finished difference. Result has 64 places, 74 transitions, 402 flow [2025-03-13 21:45:41,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=64, PETRI_TRANSITIONS=74} [2025-03-13 21:45:41,750 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-03-13 21:45:41,750 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 74 transitions, 402 flow [2025-03-13 21:45:41,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-13 21:45:41,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:41,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:41,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:45:41,752 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-13 21:45:41,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:41,752 INFO L85 PathProgramCache]: Analyzing trace with hash -523358514, now seen corresponding path program 3 times [2025-03-13 21:45:41,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:41,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421258196] [2025-03-13 21:45:41,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:45:41,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:41,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:45:41,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:41,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:45:41,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:42,143 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-13 21:45:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:42,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421258196] [2025-03-13 21:45:42,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421258196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:42,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:42,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:45:42,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040860717] [2025-03-13 21:45:42,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:42,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:42,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:42,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:42,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:42,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2025-03-13 21:45:42,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 74 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-13 21:45:42,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:42,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2025-03-13 21:45:42,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:42,757 INFO L124 PetriNetUnfolderBase]: 1303/2252 cut-off events. [2025-03-13 21:45:42,757 INFO L125 PetriNetUnfolderBase]: For 2619/2619 co-relation queries the response was YES. [2025-03-13 21:45:42,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6507 conditions, 2252 events. 1303/2252 cut-off events. For 2619/2619 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12036 event pairs, 424 based on Foata normal form. 40/2275 useless extension candidates. Maximal degree in co-relation 5183. Up to 884 conditions per place. [2025-03-13 21:45:42,769 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 59 selfloop transitions, 23 changer transitions 17/109 dead transitions. [2025-03-13 21:45:42,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 709 flow [2025-03-13 21:45:42,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2025-03-13 21:45:42,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2025-03-13 21:45:42,772 INFO L175 Difference]: Start difference. First operand has 64 places, 74 transitions, 402 flow. Second operand 5 states and 140 transitions. [2025-03-13 21:45:42,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 709 flow [2025-03-13 21:45:42,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 671 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:45:42,777 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 379 flow [2025-03-13 21:45:42,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=379, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2025-03-13 21:45:42,779 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2025-03-13 21:45:42,779 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 379 flow [2025-03-13 21:45:42,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-13 21:45:42,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:42,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:42,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:45:42,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:45:42,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 606672572, now seen corresponding path program 4 times [2025-03-13 21:45:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:42,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329971812] [2025-03-13 21:45:42,781 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:45:42,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:42,790 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-13 21:45:42,800 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:42,801 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:45:42,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:42,959 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-13 21:45:42,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:42,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329971812] [2025-03-13 21:45:42,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329971812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:42,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:42,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:45:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723221857] [2025-03-13 21:45:42,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:42,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:45:42,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:42,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:45:42,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:45:42,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2025-03-13 21:45:42,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-13 21:45:42,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:42,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2025-03-13 21:45:42,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:43,189 INFO L124 PetriNetUnfolderBase]: 1136/1951 cut-off events. [2025-03-13 21:45:43,190 INFO L125 PetriNetUnfolderBase]: For 2556/2556 co-relation queries the response was YES. [2025-03-13 21:45:43,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5789 conditions, 1951 events. 1136/1951 cut-off events. For 2556/2556 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10089 event pairs, 335 based on Foata normal form. 16/1930 useless extension candidates. Maximal degree in co-relation 2247. Up to 750 conditions per place. [2025-03-13 21:45:43,197 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 62 selfloop transitions, 26 changer transitions 11/109 dead transitions. [2025-03-13 21:45:43,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 109 transitions, 717 flow [2025-03-13 21:45:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:45:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:45:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2025-03-13 21:45:43,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5567375886524822 [2025-03-13 21:45:43,198 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 379 flow. Second operand 6 states and 157 transitions. [2025-03-13 21:45:43,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 109 transitions, 717 flow [2025-03-13 21:45:43,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 683 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:45:43,204 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 386 flow [2025-03-13 21:45:43,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2025-03-13 21:45:43,205 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2025-03-13 21:45:43,206 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 386 flow [2025-03-13 21:45:43,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-13 21:45:43,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:43,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:43,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:45:43,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:45:43,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash 273665806, now seen corresponding path program 5 times [2025-03-13 21:45:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734019181] [2025-03-13 21:45:43,207 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:45:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:43,215 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:45:43,221 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:43,222 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:45:43,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:43,312 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-13 21:45:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734019181] [2025-03-13 21:45:43,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734019181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:43,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:43,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:45:43,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506746647] [2025-03-13 21:45:43,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:43,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:45:43,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:43,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:45:43,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:45:43,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2025-03-13 21:45:43,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 386 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-13 21:45:43,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:43,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2025-03-13 21:45:43,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:43,547 INFO L124 PetriNetUnfolderBase]: 1063/1841 cut-off events. [2025-03-13 21:45:43,548 INFO L125 PetriNetUnfolderBase]: For 3285/3285 co-relation queries the response was YES. [2025-03-13 21:45:43,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5440 conditions, 1841 events. 1063/1841 cut-off events. For 3285/3285 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9534 event pairs, 317 based on Foata normal form. 16/1828 useless extension candidates. Maximal degree in co-relation 2174. Up to 676 conditions per place. [2025-03-13 21:45:43,553 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 60 selfloop transitions, 24 changer transitions 16/110 dead transitions. [2025-03-13 21:45:43,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 110 transitions, 736 flow [2025-03-13 21:45:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:45:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:45:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-03-13 21:45:43,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4867021276595745 [2025-03-13 21:45:43,554 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 386 flow. Second operand 8 states and 183 transitions. [2025-03-13 21:45:43,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 110 transitions, 736 flow [2025-03-13 21:45:43,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 682 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-13 21:45:43,557 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 369 flow [2025-03-13 21:45:43,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=369, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2025-03-13 21:45:43,557 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2025-03-13 21:45:43,557 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 369 flow [2025-03-13 21:45:43,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-13 21:45:43,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:43,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:43,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:45:43,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:45:43,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1134753332, now seen corresponding path program 6 times [2025-03-13 21:45:43,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:43,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104227531] [2025-03-13 21:45:43,559 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:45:43,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:43,564 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:45:43,568 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:43,568 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:45:43,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:43,641 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-13 21:45:43,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:43,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104227531] [2025-03-13 21:45:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104227531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:43,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:43,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:45:43,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255314693] [2025-03-13 21:45:43,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:43,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:45:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:43,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:45:43,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:45:43,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2025-03-13 21:45:43,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 369 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-13 21:45:43,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:43,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2025-03-13 21:45:43,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:43,828 INFO L124 PetriNetUnfolderBase]: 731/1315 cut-off events. [2025-03-13 21:45:43,829 INFO L125 PetriNetUnfolderBase]: For 2277/2277 co-relation queries the response was YES. [2025-03-13 21:45:43,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 1315 events. 731/1315 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6332 event pairs, 216 based on Foata normal form. 32/1334 useless extension candidates. Maximal degree in co-relation 1688. Up to 440 conditions per place. [2025-03-13 21:45:43,832 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 50 selfloop transitions, 14 changer transitions 33/105 dead transitions. [2025-03-13 21:45:43,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 105 transitions, 723 flow [2025-03-13 21:45:43,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:45:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:45:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2025-03-13 21:45:43,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48404255319148937 [2025-03-13 21:45:43,834 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 369 flow. Second operand 8 states and 182 transitions. [2025-03-13 21:45:43,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 105 transitions, 723 flow [2025-03-13 21:45:43,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 105 transitions, 657 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 21:45:43,837 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 247 flow [2025-03-13 21:45:43,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=247, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2025-03-13 21:45:43,837 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2025-03-13 21:45:43,837 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 247 flow [2025-03-13 21:45:43,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-13 21:45:43,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:43,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:43,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:45:43,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:45:43,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:43,838 INFO L85 PathProgramCache]: Analyzing trace with hash 248874422, now seen corresponding path program 3 times [2025-03-13 21:45:43,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:43,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145142020] [2025-03-13 21:45:43,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:45:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:43,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:45:43,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:43,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:45:43,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:43,912 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-13 21:45:43,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145142020] [2025-03-13 21:45:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145142020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:43,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:43,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:45:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186867348] [2025-03-13 21:45:43,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:43,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:45:43,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:43,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:45:43,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:45:43,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2025-03-13 21:45:43,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-13 21:45:43,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:43,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2025-03-13 21:45:43,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:44,037 INFO L124 PetriNetUnfolderBase]: 185/377 cut-off events. [2025-03-13 21:45:44,037 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2025-03-13 21:45:44,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 377 events. 185/377 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1311 event pairs, 60 based on Foata normal form. 32/407 useless extension candidates. Maximal degree in co-relation 689. Up to 125 conditions per place. [2025-03-13 21:45:44,038 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2025-03-13 21:45:44,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 429 flow [2025-03-13 21:45:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:45:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:45:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2025-03-13 21:45:44,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40691489361702127 [2025-03-13 21:45:44,041 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 247 flow. Second operand 8 states and 153 transitions. [2025-03-13 21:45:44,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 429 flow [2025-03-13 21:45:44,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 338 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-03-13 21:45:44,042 INFO L231 Difference]: Finished difference. Result has 59 places, 0 transitions, 0 flow [2025-03-13 21:45:44,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=59, PETRI_TRANSITIONS=0} [2025-03-13 21:45:44,043 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2025-03-13 21:45:44,043 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 0 transitions, 0 flow [2025-03-13 21:45:44,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-13 21:45:44,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-13 21:45:44,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-13 21:45:44,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-13 21:45:44,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-13 21:45:44,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:45:44,047 INFO L422 BasicCegarLoop]: Path program histogram: [6, 3, 1] [2025-03-13 21:45:44,050 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:45:44,050 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:45:44,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:45:44 BasicIcfg [2025-03-13 21:45:44,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:45:44,056 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:45:44,056 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:45:44,056 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:45:44,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:45:38" (3/4) ... [2025-03-13 21:45:44,058 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:45:44,060 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 21:45:44,060 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 21:45:44,060 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 21:45:44,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-03-13 21:45:44,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 21:45:44,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 21:45:44,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:45:44,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:45:44,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:45:44,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:45:44,109 INFO L158 Benchmark]: Toolchain (without parser) took 6397.15ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 110.4MB in the beginning and 163.7MB in the end (delta: -53.4MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2025-03-13 21:45:44,110 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:45:44,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.06ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 98.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:45:44,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.94ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 97.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:45:44,110 INFO L158 Benchmark]: Boogie Preprocessor took 31.56ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 95.8MB in the end (delta: 991.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:45:44,110 INFO L158 Benchmark]: IcfgBuilder took 418.80ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 60.8MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 21:45:44,110 INFO L158 Benchmark]: TraceAbstraction took 5659.94ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 60.3MB in the beginning and 168.0MB in the end (delta: -107.7MB). Peak memory consumption was 164.2MB. Max. memory is 16.1GB. [2025-03-13 21:45:44,111 INFO L158 Benchmark]: Witness Printer took 53.16ms. Allocated memory is still 419.4MB. Free memory was 168.0MB in the beginning and 163.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:45:44,112 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.13ms. Allocated memory is still 226.5MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.06ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 98.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.94ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 97.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.56ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 95.8MB in the end (delta: 991.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 418.80ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 60.8MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5659.94ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 60.3MB in the beginning and 168.0MB in the end (delta: -107.7MB). Peak memory consumption was 164.2MB. Max. memory is 16.1GB. * Witness Printer took 53.16ms. Allocated memory is still 419.4MB. Free memory was 168.0MB in the beginning and 163.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: 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, 73 locations, 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: 5.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 396 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1723 IncrementalHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 4 mSDtfsCounter, 1723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=5, InterpolantAutomatonStates: 57, 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, 1.4s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-13 21:45:44,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE