./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/unroll-5.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 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:11:24,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:11:24,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:11:24,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:11:24,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:11:24,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:11:24,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:11:24,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:11:24,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:11:24,672 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:11:24,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:11:24,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:11:24,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:11:24,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:11:24,672 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:11:24,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:11:24,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:11:24,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:11:24,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:11:24,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:11:24,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:11:24,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:11:24,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:11:24,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:11:24,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:11:24,674 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:11:24,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:11:24,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:11:24,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:11:24,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:11:24,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:11:24,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:11:24,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:11:24,675 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 -> 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 [2025-03-14 01:11:24,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:11:24,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:11:24,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:11:24,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:11:24,961 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:11:24,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-5.wvr.c [2025-03-14 01:11:26,102 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a5d83a7/c5a6bb80a11443c588ccb42d894d5d7e/FLAG41201716e [2025-03-14 01:11:26,355 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:11:26,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-5.wvr.c [2025-03-14 01:11:26,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a5d83a7/c5a6bb80a11443c588ccb42d894d5d7e/FLAG41201716e [2025-03-14 01:11:26,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a5d83a7/c5a6bb80a11443c588ccb42d894d5d7e [2025-03-14 01:11:26,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:11:26,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:11:26,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:11:26,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:11:26,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:11:26,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c4b3bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26, skipping insertion in model container [2025-03-14 01:11:26,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:11:26,568 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/unroll-5.wvr.c[2670,2683] [2025-03-14 01:11:26,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:11:26,589 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:11:26,611 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/unroll-5.wvr.c[2670,2683] [2025-03-14 01:11:26,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:11:26,634 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:11:26,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26 WrapperNode [2025-03-14 01:11:26,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:11:26,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:11:26,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:11:26,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:11:26,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,674 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 148 [2025-03-14 01:11:26,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:11:26,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:11:26,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:11:26,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:11:26,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,705 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-14 01:11:26,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:11:26,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:11:26,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:11:26,729 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:11:26,729 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (1/1) ... [2025-03-14 01:11:26,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:11:26,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:26,758 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-14 01:11:26,760 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-14 01:11:26,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:11:26,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:11:26,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:11:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:11:26,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:11:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:11:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:11:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:11:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:11:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:11:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:11:26,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:11:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:11:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:11:26,782 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:11:26,866 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:11:26,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:11:27,131 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:11:27,132 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:11:27,132 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:11:27,349 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:11:27,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:11:27 BoogieIcfgContainer [2025-03-14 01:11:27,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:11:27,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:11:27,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:11:27,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:11:27,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:11:26" (1/3) ... [2025-03-14 01:11:27,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a84871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:11:27, skipping insertion in model container [2025-03-14 01:11:27,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:26" (2/3) ... [2025-03-14 01:11:27,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a84871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:11:27, skipping insertion in model container [2025-03-14 01:11:27,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:11:27" (3/3) ... [2025-03-14 01:11:27,359 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2025-03-14 01:11:27,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:11:27,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-5.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-14 01:11:27,371 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:11:27,426 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:11:27,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-03-14 01:11:27,476 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-14 01:11:27,479 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:11:27,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-14 01:11:27,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-03-14 01:11:27,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-03-14 01:11:27,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:11:27,505 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;@6b8907bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:11:27,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 01:11:27,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:11:27,515 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-03-14 01:11:27,515 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:11:27,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:27,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:27,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:27,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:27,523 INFO L85 PathProgramCache]: Analyzing trace with hash -712199744, now seen corresponding path program 1 times [2025-03-14 01:11:27,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:27,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121015090] [2025-03-14 01:11:27,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:27,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:27,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 01:11:27,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 01:11:27,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:27,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:27,815 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-14 01:11:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121015090] [2025-03-14 01:11:27,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121015090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:27,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:27,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:11:27,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331861218] [2025-03-14 01:11:27,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:27,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:11:27,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:27,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:11:27,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:11:27,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:27,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-14 01:11:27,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:27,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:27,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:27,945 INFO L124 PetriNetUnfolderBase]: 69/125 cut-off events. [2025-03-14 01:11:27,945 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-14 01:11:27,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 125 events. 69/125 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 315 event pairs, 22 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-03-14 01:11:27,948 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 23 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2025-03-14 01:11:27,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 131 flow [2025-03-14 01:11:27,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:11:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:11:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-03-14 01:11:27,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-03-14 01:11:27,960 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 37 transitions. [2025-03-14 01:11:27,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 131 flow [2025-03-14 01:11:27,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 117 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:11:27,967 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2025-03-14 01:11:27,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2025-03-14 01:11:27,975 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-03-14 01:11:27,975 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2025-03-14 01:11:27,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-14 01:11:27,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:27,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:27,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:11:27,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:27,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash 856767773, now seen corresponding path program 1 times [2025-03-14 01:11:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:27,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447733473] [2025-03-14 01:11:27,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:27,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:11:28,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:11:28,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:28,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447733473] [2025-03-14 01:11:28,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447733473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:28,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:28,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:11:28,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847150548] [2025-03-14 01:11:28,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:28,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:11:28,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:28,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:11:28,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:11:28,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:28,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-14 01:11:28,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:28,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:28,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:28,247 INFO L124 PetriNetUnfolderBase]: 69/126 cut-off events. [2025-03-14 01:11:28,247 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-14 01:11:28,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 126 events. 69/126 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 303 event pairs, 44 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2025-03-14 01:11:28,250 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2025-03-14 01:11:28,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 20 transitions, 97 flow [2025-03-14 01:11:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:11:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:11:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-03-14 01:11:28,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-14 01:11:28,252 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 3 states and 27 transitions. [2025-03-14 01:11:28,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 20 transitions, 97 flow [2025-03-14 01:11:28,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:28,253 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 66 flow [2025-03-14 01:11:28,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2025-03-14 01:11:28,254 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2025-03-14 01:11:28,254 INFO L471 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 66 flow [2025-03-14 01:11:28,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-14 01:11:28,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:28,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:28,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:11:28,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:28,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1931817034, now seen corresponding path program 1 times [2025-03-14 01:11:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:28,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422591287] [2025-03-14 01:11:28,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:28,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:11:28,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:28,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:28,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:28,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:28,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:28,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422591287] [2025-03-14 01:11:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422591287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:28,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694131948] [2025-03-14 01:11:28,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:28,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:28,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:28,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:11:28,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:11:28,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:11:28,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:28,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:28,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:28,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:11:28,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:28,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694131948] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:28,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:11:28,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-03-14 01:11:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679873203] [2025-03-14 01:11:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:11:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:28,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:11:28,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:11:28,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:28,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-14 01:11:28,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:28,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:28,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:28,771 INFO L124 PetriNetUnfolderBase]: 76/138 cut-off events. [2025-03-14 01:11:28,772 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-14 01:11:28,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 138 events. 76/138 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 22 based on Foata normal form. 5/142 useless extension candidates. Maximal degree in co-relation 317. Up to 71 conditions per place. [2025-03-14 01:11:28,774 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2025-03-14 01:11:28,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 168 flow [2025-03-14 01:11:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:11:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:11:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-03-14 01:11:28,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-14 01:11:28,776 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 66 flow. Second operand 4 states and 45 transitions. [2025-03-14 01:11:28,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 168 flow [2025-03-14 01:11:28,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:28,778 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 88 flow [2025-03-14 01:11:28,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-14 01:11:28,779 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-03-14 01:11:28,780 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 88 flow [2025-03-14 01:11:28,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-14 01:11:28,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:28,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:28,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:11:28,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:28,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:28,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:28,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1353308449, now seen corresponding path program 1 times [2025-03-14 01:11:28,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:28,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924595126] [2025-03-14 01:11:28,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:28,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:28,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:11:29,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:29,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:29,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:29,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:29,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924595126] [2025-03-14 01:11:29,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924595126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:29,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:29,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:11:29,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024932383] [2025-03-14 01:11:29,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:29,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:11:29,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:29,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:11:29,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:11:29,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:29,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-14 01:11:29,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:29,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:29,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:29,288 INFO L124 PetriNetUnfolderBase]: 85/167 cut-off events. [2025-03-14 01:11:29,288 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-14 01:11:29,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 167 events. 85/167 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 549 event pairs, 24 based on Foata normal form. 9/175 useless extension candidates. Maximal degree in co-relation 442. Up to 93 conditions per place. [2025-03-14 01:11:29,291 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 31 selfloop transitions, 4 changer transitions 7/43 dead transitions. [2025-03-14 01:11:29,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 43 transitions, 243 flow [2025-03-14 01:11:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:11:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:11:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-03-14 01:11:29,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-03-14 01:11:29,293 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 88 flow. Second operand 5 states and 53 transitions. [2025-03-14 01:11:29,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 43 transitions, 243 flow [2025-03-14 01:11:29,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 238 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:29,295 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 115 flow [2025-03-14 01:11:29,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-03-14 01:11:29,296 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2025-03-14 01:11:29,296 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 115 flow [2025-03-14 01:11:29,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-14 01:11:29,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:29,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:11:29,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1863137538, now seen corresponding path program 2 times [2025-03-14 01:11:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002788140] [2025-03-14 01:11:29,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:29,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:29,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:29,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:11:29,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002788140] [2025-03-14 01:11:29,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002788140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837727115] [2025-03-14 01:11:29,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:29,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:29,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:29,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:11:29,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:11:29,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:29,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:29,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:11:29,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:29,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:11:29,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:29,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837727115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:11:29,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:11:29,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-14 01:11:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529632476] [2025-03-14 01:11:29,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:11:29,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:11:29,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:29,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:11:29,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:11:29,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:29,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 115 flow. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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-14 01:11:29,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:29,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:29,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:29,948 INFO L124 PetriNetUnfolderBase]: 108/212 cut-off events. [2025-03-14 01:11:29,949 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-03-14 01:11:29,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 212 events. 108/212 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 698 event pairs, 38 based on Foata normal form. 5/216 useless extension candidates. Maximal degree in co-relation 702. Up to 119 conditions per place. [2025-03-14 01:11:29,952 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 30 selfloop transitions, 12 changer transitions 5/48 dead transitions. [2025-03-14 01:11:29,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 324 flow [2025-03-14 01:11:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:11:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:11:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2025-03-14 01:11:29,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-14 01:11:29,955 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 115 flow. Second operand 6 states and 57 transitions. [2025-03-14 01:11:29,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 324 flow [2025-03-14 01:11:29,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 306 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-14 01:11:29,958 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 196 flow [2025-03-14 01:11:29,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-03-14 01:11:29,960 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2025-03-14 01:11:29,960 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 196 flow [2025-03-14 01:11:29,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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-14 01:11:29,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:29,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:29,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:11:30,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:30,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:30,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:30,162 INFO L85 PathProgramCache]: Analyzing trace with hash 77100151, now seen corresponding path program 2 times [2025-03-14 01:11:30,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:30,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377843643] [2025-03-14 01:11:30,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:30,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:30,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:30,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:30,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:11:30,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:30,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:30,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377843643] [2025-03-14 01:11:30,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377843643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:30,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559944551] [2025-03-14 01:11:30,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:30,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:30,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:11:30,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:11:30,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:30,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:30,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:11:30,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:30,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:11:30,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:30,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559944551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:11:30,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:11:30,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-14 01:11:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338388921] [2025-03-14 01:11:30,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:11:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:11:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:30,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:11:30,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:11:30,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:30,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-14 01:11:30,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:30,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:30,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:30,547 INFO L124 PetriNetUnfolderBase]: 114/222 cut-off events. [2025-03-14 01:11:30,547 INFO L125 PetriNetUnfolderBase]: For 407/407 co-relation queries the response was YES. [2025-03-14 01:11:30,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 222 events. 114/222 cut-off events. For 407/407 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 779 event pairs, 34 based on Foata normal form. 4/226 useless extension candidates. Maximal degree in co-relation 832. Up to 134 conditions per place. [2025-03-14 01:11:30,549 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 35 selfloop transitions, 11 changer transitions 3/50 dead transitions. [2025-03-14 01:11:30,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 389 flow [2025-03-14 01:11:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:11:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:11:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-03-14 01:11:30,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54 [2025-03-14 01:11:30,550 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 196 flow. Second operand 5 states and 54 transitions. [2025-03-14 01:11:30,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 389 flow [2025-03-14 01:11:30,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 386 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:30,555 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 272 flow [2025-03-14 01:11:30,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-14 01:11:30,556 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2025-03-14 01:11:30,556 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 272 flow [2025-03-14 01:11:30,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-14 01:11:30,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:30,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:30,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:11:30,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:30,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:30,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash -564105027, now seen corresponding path program 3 times [2025-03-14 01:11:30,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:30,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370773971] [2025-03-14 01:11:30,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:11:30,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:30,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:30,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:30,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:11:30,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370773971] [2025-03-14 01:11:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370773971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:30,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616085563] [2025-03-14 01:11:30,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:11:30,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:30,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:30,846 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:11:30,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:11:30,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:30,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:30,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:11:30,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:30,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:11:30,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:30,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616085563] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:30,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:11:30,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-03-14 01:11:30,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243356018] [2025-03-14 01:11:30,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:30,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:11:30,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:30,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:11:30,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:11:30,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:30,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-14 01:11:30,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:30,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:30,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:31,039 INFO L124 PetriNetUnfolderBase]: 115/218 cut-off events. [2025-03-14 01:11:31,040 INFO L125 PetriNetUnfolderBase]: For 543/543 co-relation queries the response was YES. [2025-03-14 01:11:31,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 218 events. 115/218 cut-off events. For 543/543 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 731 event pairs, 33 based on Foata normal form. 4/221 useless extension candidates. Maximal degree in co-relation 924. Up to 133 conditions per place. [2025-03-14 01:11:31,042 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 33 selfloop transitions, 9 changer transitions 3/46 dead transitions. [2025-03-14 01:11:31,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 417 flow [2025-03-14 01:11:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:11:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:11:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-03-14 01:11:31,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-14 01:11:31,044 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 272 flow. Second operand 4 states and 44 transitions. [2025-03-14 01:11:31,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 417 flow [2025-03-14 01:11:31,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 402 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:31,049 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 301 flow [2025-03-14 01:11:31,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-14 01:11:31,049 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2025-03-14 01:11:31,049 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 301 flow [2025-03-14 01:11:31,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-14 01:11:31,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:31,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:31,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 01:11:31,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:31,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:31,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash -784544942, now seen corresponding path program 3 times [2025-03-14 01:11:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:31,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133966268] [2025-03-14 01:11:31,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:11:31,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:31,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:31,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:31,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:11:31,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:31,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:31,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133966268] [2025-03-14 01:11:31,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133966268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:31,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358335860] [2025-03-14 01:11:31,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:11:31,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:31,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:31,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:11:31,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:11:31,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:31,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:31,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:11:31,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:31,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:11:31,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:31,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:11:31,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358335860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:31,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:11:31,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-14 01:11:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307291803] [2025-03-14 01:11:31,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:31,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:11:31,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:31,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:11:31,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:11:31,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:31,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-14 01:11:31,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:31,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:31,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:31,957 INFO L124 PetriNetUnfolderBase]: 100/184 cut-off events. [2025-03-14 01:11:31,957 INFO L125 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2025-03-14 01:11:31,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 184 events. 100/184 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 533 event pairs, 31 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 808. Up to 136 conditions per place. [2025-03-14 01:11:31,958 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 30 selfloop transitions, 11 changer transitions 2/44 dead transitions. [2025-03-14 01:11:31,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 420 flow [2025-03-14 01:11:31,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:11:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:11:31,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2025-03-14 01:11:31,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44 [2025-03-14 01:11:31,959 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 301 flow. Second operand 5 states and 44 transitions. [2025-03-14 01:11:31,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 420 flow [2025-03-14 01:11:31,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 388 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-14 01:11:31,962 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 296 flow [2025-03-14 01:11:31,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-14 01:11:31,962 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2025-03-14 01:11:31,962 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 296 flow [2025-03-14 01:11:31,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-14 01:11:31,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:31,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:31,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 01:11:32,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:32,167 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:32,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1504704488, now seen corresponding path program 4 times [2025-03-14 01:11:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:32,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397403845] [2025-03-14 01:11:32,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:11:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:32,173 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:32,180 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:32,180 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:11:32,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:32,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397403845] [2025-03-14 01:11:32,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397403845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:32,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:32,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:11:32,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797310932] [2025-03-14 01:11:32,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:32,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:11:32,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:32,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:11:32,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:11:32,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:32,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-14 01:11:32,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:32,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:32,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:32,358 INFO L124 PetriNetUnfolderBase]: 95/169 cut-off events. [2025-03-14 01:11:32,358 INFO L125 PetriNetUnfolderBase]: For 618/618 co-relation queries the response was YES. [2025-03-14 01:11:32,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 169 events. 95/169 cut-off events. For 618/618 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 464 event pairs, 18 based on Foata normal form. 2/170 useless extension candidates. Maximal degree in co-relation 782. Up to 89 conditions per place. [2025-03-14 01:11:32,360 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 34 selfloop transitions, 15 changer transitions 3/53 dead transitions. [2025-03-14 01:11:32,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 500 flow [2025-03-14 01:11:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:11:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:11:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2025-03-14 01:11:32,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-14 01:11:32,361 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 296 flow. Second operand 6 states and 52 transitions. [2025-03-14 01:11:32,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 500 flow [2025-03-14 01:11:32,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 470 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-14 01:11:32,365 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 352 flow [2025-03-14 01:11:32,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-03-14 01:11:32,366 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2025-03-14 01:11:32,367 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 352 flow [2025-03-14 01:11:32,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-14 01:11:32,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:32,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:32,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:11:32,368 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:32,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1647890297, now seen corresponding path program 1 times [2025-03-14 01:11:32,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:32,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312336613] [2025-03-14 01:11:32,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:32,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:11:32,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:11:32,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:32,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:11:32,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:32,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312336613] [2025-03-14 01:11:32,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312336613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:32,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383880790] [2025-03-14 01:11:32,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:32,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:32,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:32,549 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:11:32,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:11:32,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:11:32,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:11:32,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:32,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:32,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-14 01:11:32,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:32,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:11:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:32,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:33,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 314 [2025-03-14 01:11:33,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:11:33,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 4127 treesize of output 2929 [2025-03-14 01:12:36,249 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts.