/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:23:22,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:23:22,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:23:22,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:23:22,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:23:22,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:23:22,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:23:22,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:23:22,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:23:22,102 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:23:22,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:23:22,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:23:22,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:23:22,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:23:22,103 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:23:22,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:23:22,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:23:22,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:23:22,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:23:22,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:23:22,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:23:22,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:23:22,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:23:22,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:23:22,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:23:22,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:23:22,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:23:22,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:23:22,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:23:22,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:23:22,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:23:22,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:23:22,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:23:22,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:23:22,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:23:22,105 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:23:22,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:23:22,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:23:22,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:23:22,342 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:23:22,343 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:23:22,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-13 20:23:23,655 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9fdddf2d/3c90333a62ff4575a9219182e85baa73/FLAG8d551e868 [2025-04-13 20:23:23,899 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:23:23,900 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-13 20:23:23,915 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9fdddf2d/3c90333a62ff4575a9219182e85baa73/FLAG8d551e868 [2025-04-13 20:23:24,656 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9fdddf2d/3c90333a62ff4575a9219182e85baa73 [2025-04-13 20:23:24,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:23:24,659 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:23:24,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:23:24,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:23:24,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:23:24,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba8598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24, skipping insertion in model container [2025-04-13 20:23:24,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:23:24,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-13 20:23:24,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:23:24,859 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:23:24,886 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-13 20:23:24,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:23:24,903 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:23:24,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24 WrapperNode [2025-04-13 20:23:24,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:23:24,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:23:24,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:23:24,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:23:24,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,940 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2025-04-13 20:23:24,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:23:24,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:23:24,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:23:24,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:23:24,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,967 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-13 20:23:24,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:23:24,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:23:24,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:23:24,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:23:24,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (1/1) ... [2025-04-13 20:23:24,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:23:24,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:25,006 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-04-13 20:23:25,008 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-04-13 20:23:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:23:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:23:25,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:23:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:23:25,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:23:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:23:25,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:23:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:23:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:23:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:23:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:23:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:23:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:23:25,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:23:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:23:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:23:25,025 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:23:25,109 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:23:25,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:23:25,457 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:23:25,458 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:23:25,458 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:23:25,789 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:23:25,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:23:25 BoogieIcfgContainer [2025-04-13 20:23:25,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:23:25,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:23:25,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:23:25,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:23:25,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:23:24" (1/3) ... [2025-04-13 20:23:25,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7232442c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:23:25, skipping insertion in model container [2025-04-13 20:23:25,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:24" (2/3) ... [2025-04-13 20:23:25,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7232442c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:23:25, skipping insertion in model container [2025-04-13 20:23:25,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:23:25" (3/3) ... [2025-04-13 20:23:25,797 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-04-13 20:23:25,807 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:23:25,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 20:23:25,809 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:23:25,850 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:23:25,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 20:23:25,897 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-13 20:23:25,899 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:23:25,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 20:23:25,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 20:23:25,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2025-04-13 20:23:25,914 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:23:25,924 INFO L340 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;@54b4fa31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:23:25,924 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:23:25,936 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:23:25,936 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-13 20:23:25,936 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:23:25,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:25,938 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:25,939 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:25,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:25,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1590580698, now seen corresponding path program 1 times [2025-04-13 20:23:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:25,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98341054] [2025-04-13 20:23:25,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:26,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:23:26,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:23:26,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:26,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:26,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:26,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98341054] [2025-04-13 20:23:26,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98341054] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:26,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:26,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:23:26,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729638670] [2025-04-13 20:23:26,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:26,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:23:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:26,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:23:26,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:23:26,631 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:23:26,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-04-13 20:23:26,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:26,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:23:26,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:26,829 INFO L116 PetriNetUnfolderBase]: 392/576 cut-off events. [2025-04-13 20:23:26,829 INFO L117 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-04-13 20:23:26,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 576 events. 392/576 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1778 event pairs, 124 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-04-13 20:23:26,837 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 38 selfloop transitions, 10 changer transitions 1/49 dead transitions. [2025-04-13 20:23:26,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 49 transitions, 229 flow [2025-04-13 20:23:26,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:23:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:23:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-13 20:23:26,848 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-04-13 20:23:26,849 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 70 flow. Second operand 4 states and 62 transitions. [2025-04-13 20:23:26,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 49 transitions, 229 flow [2025-04-13 20:23:26,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 49 transitions, 207 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:23:26,858 INFO L231 Difference]: Finished difference. Result has 29 places, 35 transitions, 132 flow [2025-04-13 20:23:26,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=29, PETRI_TRANSITIONS=35} [2025-04-13 20:23:26,862 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-04-13 20:23:26,863 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 35 transitions, 132 flow [2025-04-13 20:23:26,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-04-13 20:23:26,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:26,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:26,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:23:26,863 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:26,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash -345164483, now seen corresponding path program 1 times [2025-04-13 20:23:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:26,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991620502] [2025-04-13 20:23:26,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:26,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:23:26,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:23:26,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:26,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:27,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:27,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991620502] [2025-04-13 20:23:27,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991620502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:27,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:27,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:23:27,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169434688] [2025-04-13 20:23:27,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:27,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:23:27,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:27,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:23:27,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:23:27,035 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:23:27,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 35 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-04-13 20:23:27,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:27,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:23:27,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:27,276 INFO L116 PetriNetUnfolderBase]: 725/1085 cut-off events. [2025-04-13 20:23:27,276 INFO L117 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2025-04-13 20:23:27,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2629 conditions, 1085 events. 725/1085 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3833 event pairs, 417 based on Foata normal form. 43/1126 useless extension candidates. Maximal degree in co-relation 1375. Up to 571 conditions per place. [2025-04-13 20:23:27,281 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 56 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2025-04-13 20:23:27,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 68 transitions, 370 flow [2025-04-13 20:23:27,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:23:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:23:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-04-13 20:23:27,282 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-04-13 20:23:27,282 INFO L175 Difference]: Start difference. First operand has 29 places, 35 transitions, 132 flow. Second operand 6 states and 82 transitions. [2025-04-13 20:23:27,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 68 transitions, 370 flow [2025-04-13 20:23:27,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 68 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:23:27,283 INFO L231 Difference]: Finished difference. Result has 36 places, 39 transitions, 191 flow [2025-04-13 20:23:27,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=36, PETRI_TRANSITIONS=39} [2025-04-13 20:23:27,284 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-13 20:23:27,284 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 39 transitions, 191 flow [2025-04-13 20:23:27,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-04-13 20:23:27,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:27,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:27,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:23:27,285 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:27,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2065645663, now seen corresponding path program 1 times [2025-04-13 20:23:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:27,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375634066] [2025-04-13 20:23:27,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:27,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:27,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:23:27,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:23:27,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:27,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:27,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:27,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375634066] [2025-04-13 20:23:27,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375634066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:27,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:27,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:23:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119790996] [2025-04-13 20:23:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:27,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:23:27,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:27,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:23:27,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:23:27,370 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:23:27,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 39 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-04-13 20:23:27,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:27,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:23:27,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:27,564 INFO L116 PetriNetUnfolderBase]: 640/977 cut-off events. [2025-04-13 20:23:27,564 INFO L117 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-04-13 20:23:27,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 977 events. 640/977 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3510 event pairs, 391 based on Foata normal form. 42/1018 useless extension candidates. Maximal degree in co-relation 1436. Up to 571 conditions per place. [2025-04-13 20:23:27,568 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 54 selfloop transitions, 12 changer transitions 0/66 dead transitions. [2025-04-13 20:23:27,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 403 flow [2025-04-13 20:23:27,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:23:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:23:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2025-04-13 20:23:27,569 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-13 20:23:27,569 INFO L175 Difference]: Start difference. First operand has 36 places, 39 transitions, 191 flow. Second operand 6 states and 80 transitions. [2025-04-13 20:23:27,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 403 flow [2025-04-13 20:23:27,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 391 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 20:23:27,572 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 221 flow [2025-04-13 20:23:27,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2025-04-13 20:23:27,573 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-04-13 20:23:27,573 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 221 flow [2025-04-13 20:23:27,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-04-13 20:23:27,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:27,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:27,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:23:27,573 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:27,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash 724682616, now seen corresponding path program 1 times [2025-04-13 20:23:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:27,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393969058] [2025-04-13 20:23:27,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:27,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:23:27,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:23:27,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:27,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:27,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:27,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393969058] [2025-04-13 20:23:27,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393969058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:27,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:27,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:23:27,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537318427] [2025-04-13 20:23:27,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:27,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:23:27,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:27,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:23:27,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:23:27,663 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:23:27,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-04-13 20:23:27,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:27,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:23:27,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:27,812 INFO L116 PetriNetUnfolderBase]: 515/793 cut-off events. [2025-04-13 20:23:27,812 INFO L117 PetriNetUnfolderBase]: For 639/639 co-relation queries the response was YES. [2025-04-13 20:23:27,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 793 events. 515/793 cut-off events. For 639/639 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2664 event pairs, 324 based on Foata normal form. 27/819 useless extension candidates. Maximal degree in co-relation 1586. Up to 571 conditions per place. [2025-04-13 20:23:27,816 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 26 selfloop transitions, 6 changer transitions 28/60 dead transitions. [2025-04-13 20:23:27,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 403 flow [2025-04-13 20:23:27,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:23:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:23:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2025-04-13 20:23:27,817 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2025-04-13 20:23:27,817 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 221 flow. Second operand 6 states and 76 transitions. [2025-04-13 20:23:27,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 403 flow [2025-04-13 20:23:27,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 385 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 20:23:27,821 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 160 flow [2025-04-13 20:23:27,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2025-04-13 20:23:27,822 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2025-04-13 20:23:27,823 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 160 flow [2025-04-13 20:23:27,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-04-13 20:23:27,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:27,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:27,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:23:27,823 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:27,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 106891185, now seen corresponding path program 1 times [2025-04-13 20:23:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:27,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883430845] [2025-04-13 20:23:27,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:27,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:23:27,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:23:27,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:27,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:27,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:27,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883430845] [2025-04-13 20:23:27,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883430845] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:27,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316505750] [2025-04-13 20:23:27,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:27,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:27,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:27,991 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-04-13 20:23:27,992 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-04-13 20:23:28,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:23:28,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:23:28,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:28,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:28,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:23:28,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:28,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:28,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316505750] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:28,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:23:28,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-13 20:23:28,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616113828] [2025-04-13 20:23:28,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:28,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:23:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:28,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:23:28,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:23:28,219 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:23:28,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-04-13 20:23:28,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:28,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:23:28,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:28,343 INFO L116 PetriNetUnfolderBase]: 377/553 cut-off events. [2025-04-13 20:23:28,343 INFO L117 PetriNetUnfolderBase]: For 510/510 co-relation queries the response was YES. [2025-04-13 20:23:28,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 553 events. 377/553 cut-off events. For 510/510 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1665 event pairs, 150 based on Foata normal form. 50/602 useless extension candidates. Maximal degree in co-relation 1662. Up to 385 conditions per place. [2025-04-13 20:23:28,346 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 40 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2025-04-13 20:23:28,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 304 flow [2025-04-13 20:23:28,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:23:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:23:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-04-13 20:23:28,348 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36 [2025-04-13 20:23:28,348 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 160 flow. Second operand 5 states and 54 transitions. [2025-04-13 20:23:28,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 304 flow [2025-04-13 20:23:28,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 240 flow, removed 20 selfloop flow, removed 10 redundant places. [2025-04-13 20:23:28,352 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 133 flow [2025-04-13 20:23:28,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2025-04-13 20:23:28,353 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-04-13 20:23:28,353 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 133 flow [2025-04-13 20:23:28,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-04-13 20:23:28,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:28,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:28,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:23:28,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:28,554 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:28,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1216067282, now seen corresponding path program 1 times [2025-04-13 20:23:28,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:28,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947107731] [2025-04-13 20:23:28,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:28,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:28,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:23:28,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:23:28,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:28,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:28,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:28,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947107731] [2025-04-13 20:23:28,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947107731] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:28,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934631777] [2025-04-13 20:23:28,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:28,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:28,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:28,679 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-04-13 20:23:28,681 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-04-13 20:23:28,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:23:28,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:23:28,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:28,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:28,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:23:28,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:28,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:28,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934631777] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:28,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:23:28,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-13 20:23:28,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20748511] [2025-04-13 20:23:28,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:28,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:23:28,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:28,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:23:28,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:23:28,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:23:28,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-04-13 20:23:28,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:28,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:23:28,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:28,986 INFO L116 PetriNetUnfolderBase]: 383/559 cut-off events. [2025-04-13 20:23:28,986 INFO L117 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-04-13 20:23:28,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 559 events. 383/559 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1697 event pairs, 164 based on Foata normal form. 42/600 useless extension candidates. Maximal degree in co-relation 1517. Up to 418 conditions per place. [2025-04-13 20:23:28,989 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 43 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-04-13 20:23:28,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 286 flow [2025-04-13 20:23:28,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:23:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:23:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-04-13 20:23:28,990 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-04-13 20:23:28,990 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 133 flow. Second operand 5 states and 55 transitions. [2025-04-13 20:23:28,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 286 flow [2025-04-13 20:23:28,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 268 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 20:23:28,991 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 143 flow [2025-04-13 20:23:28,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-04-13 20:23:28,992 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-13 20:23:28,992 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 143 flow [2025-04-13 20:23:28,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-04-13 20:23:28,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:28,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:29,000 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-04-13 20:23:29,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:23:29,198 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:29,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2120173971, now seen corresponding path program 1 times [2025-04-13 20:23:29,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:29,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916234416] [2025-04-13 20:23:29,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:29,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:29,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:23:29,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:23:29,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:29,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:23:29,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:29,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916234416] [2025-04-13 20:23:29,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916234416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:29,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554957794] [2025-04-13 20:23:29,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:29,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:29,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:29,319 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-04-13 20:23:29,320 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-04-13 20:23:29,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:23:29,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:23:29,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:29,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:29,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:23:29,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:23:29,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:23:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554957794] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:29,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:23:29,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-13 20:23:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088101566] [2025-04-13 20:23:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:29,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:23:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:29,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:23:29,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:23:29,517 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:23:29,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-04-13 20:23:29,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:29,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:23:29,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:29,630 INFO L116 PetriNetUnfolderBase]: 432/629 cut-off events. [2025-04-13 20:23:29,630 INFO L117 PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES. [2025-04-13 20:23:29,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 629 events. 432/629 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1893 event pairs, 202 based on Foata normal form. 37/665 useless extension candidates. Maximal degree in co-relation 1847. Up to 502 conditions per place. [2025-04-13 20:23:29,634 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 43 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-04-13 20:23:29,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 302 flow [2025-04-13 20:23:29,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:23:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:23:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-04-13 20:23:29,636 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35333333333333333 [2025-04-13 20:23:29,636 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 143 flow. Second operand 5 states and 53 transitions. [2025-04-13 20:23:29,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 302 flow [2025-04-13 20:23:29,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 284 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 20:23:29,637 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 153 flow [2025-04-13 20:23:29,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-04-13 20:23:29,638 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2025-04-13 20:23:29,638 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 153 flow [2025-04-13 20:23:29,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-04-13 20:23:29,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:29,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:29,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:23:29,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:29,839 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:29,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1097588992, now seen corresponding path program 1 times [2025-04-13 20:23:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:29,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896665387] [2025-04-13 20:23:29,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:29,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:29,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:23:29,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:23:29,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:29,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:23:30,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:30,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896665387] [2025-04-13 20:23:30,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896665387] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:30,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286266386] [2025-04-13 20:23:30,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:30,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:30,777 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-04-13 20:23:30,780 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-04-13 20:23:30,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:23:30,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:23:30,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:30,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:30,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 20:23:30,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:30,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:23:30,960 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:23:30,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:23:31,186 INFO L325 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-04-13 20:23:31,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:23:31,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-04-13 20:23:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:31,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:35,608 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse1 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 ~B~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)))) (= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~B~0.base) (+ ~B~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4)))) (+ .cse1 c_~csum~0 .cse2))))) is different from false [2025-04-13 20:23:39,658 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int#1| c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select |c_#memory_int#1| c_~B~0.base) ~B~0.offset))) (= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ ~B~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))))))) is different from false [2025-04-13 20:23:39,940 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:23:39,940 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 40 [2025-04-13 20:23:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2025-04-13 20:23:40,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286266386] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:40,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:40,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2025-04-13 20:23:40,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130223552] [2025-04-13 20:23:40,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:40,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 20:23:40,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:40,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 20:23:40,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=638, Unknown=2, NotChecked=106, Total=870 [2025-04-13 20:23:40,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:23:40,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 153 flow. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 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-04-13 20:23:40,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:40,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:23:40,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:44,763 INFO L116 PetriNetUnfolderBase]: 618/899 cut-off events. [2025-04-13 20:23:44,763 INFO L117 PetriNetUnfolderBase]: For 686/686 co-relation queries the response was YES. [2025-04-13 20:23:44,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 899 events. 618/899 cut-off events. For 686/686 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3012 event pairs, 27 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 2808. Up to 659 conditions per place. [2025-04-13 20:23:44,768 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 65 selfloop transitions, 30 changer transitions 1/96 dead transitions. [2025-04-13 20:23:44,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 96 transitions, 579 flow [2025-04-13 20:23:44,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:23:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:23:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2025-04-13 20:23:44,769 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34102564102564104 [2025-04-13 20:23:44,769 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 153 flow. Second operand 13 states and 133 transitions. [2025-04-13 20:23:44,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 96 transitions, 579 flow [2025-04-13 20:23:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 96 transitions, 552 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-13 20:23:44,771 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 334 flow [2025-04-13 20:23:44,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=334, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2025-04-13 20:23:44,772 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-04-13 20:23:44,772 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 334 flow [2025-04-13 20:23:44,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 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-04-13 20:23:44,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:44,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:44,779 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-04-13 20:23:44,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:44,976 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:44,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:44,976 INFO L85 PathProgramCache]: Analyzing trace with hash 367483332, now seen corresponding path program 2 times [2025-04-13 20:23:44,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:44,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034206306] [2025-04-13 20:23:44,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:23:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:44,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:23:45,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:23:45,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:23:45,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:47,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:47,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034206306] [2025-04-13 20:23:47,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034206306] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:47,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95509899] [2025-04-13 20:23:47,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:23:47,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:47,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:47,309 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-04-13 20:23:47,310 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-04-13 20:23:47,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:23:47,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:23:47,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:23:47,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:47,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:23:47,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:48,655 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:23:48,656 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:23:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:48,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:49,104 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:23:49,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-13 20:23:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95509899] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:50,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 20 [2025-04-13 20:23:50,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759941512] [2025-04-13 20:23:50,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:50,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:23:50,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:50,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:23:50,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:23:50,280 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:23:50,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 334 flow. Second operand has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 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-04-13 20:23:50,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:50,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:23:50,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:53,201 INFO L116 PetriNetUnfolderBase]: 720/1046 cut-off events. [2025-04-13 20:23:53,201 INFO L117 PetriNetUnfolderBase]: For 1413/1413 co-relation queries the response was YES. [2025-04-13 20:23:53,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 1046 events. 720/1046 cut-off events. For 1413/1413 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3558 event pairs, 117 based on Foata normal form. 1/1047 useless extension candidates. Maximal degree in co-relation 3873. Up to 894 conditions per place. [2025-04-13 20:23:53,205 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 69 selfloop transitions, 35 changer transitions 1/105 dead transitions. [2025-04-13 20:23:53,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 105 transitions, 788 flow [2025-04-13 20:23:53,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:23:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:23:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2025-04-13 20:23:53,207 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28 [2025-04-13 20:23:53,207 INFO L175 Difference]: Start difference. First operand has 51 places, 55 transitions, 334 flow. Second operand 15 states and 126 transitions. [2025-04-13 20:23:53,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 105 transitions, 788 flow [2025-04-13 20:23:53,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 105 transitions, 723 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-04-13 20:23:53,210 INFO L231 Difference]: Finished difference. Result has 69 places, 78 transitions, 552 flow [2025-04-13 20:23:53,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=552, PETRI_PLACES=69, PETRI_TRANSITIONS=78} [2025-04-13 20:23:53,211 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2025-04-13 20:23:53,211 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 552 flow [2025-04-13 20:23:53,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 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-04-13 20:23:53,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:53,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:53,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:23:53,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:53,414 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:53,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1555277778, now seen corresponding path program 3 times [2025-04-13 20:23:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:53,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403677695] [2025-04-13 20:23:53,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:23:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:53,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:23:53,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:23:53,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:23:53,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:55,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403677695] [2025-04-13 20:23:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403677695] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:55,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216136561] [2025-04-13 20:23:55,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:23:55,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:55,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:55,699 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-04-13 20:23:55,699 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-04-13 20:23:55,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:23:55,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:23:55,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:23:55,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:55,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:23:55,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:56,879 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:23:56,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:23:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:56,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:57,441 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:23:57,442 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2025-04-13 20:23:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216136561] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:58,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:58,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 20 [2025-04-13 20:23:58,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983179773] [2025-04-13 20:23:58,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:58,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:23:58,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:58,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:23:58,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:23:58,167 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:23:58,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 552 flow. Second operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 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-04-13 20:23:58,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:58,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:23:58,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:24:00,919 INFO L116 PetriNetUnfolderBase]: 841/1220 cut-off events. [2025-04-13 20:24:00,919 INFO L117 PetriNetUnfolderBase]: For 2553/2553 co-relation queries the response was YES. [2025-04-13 20:24:00,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5058 conditions, 1220 events. 841/1220 cut-off events. For 2553/2553 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4322 event pairs, 144 based on Foata normal form. 1/1221 useless extension candidates. Maximal degree in co-relation 4997. Up to 1045 conditions per place. [2025-04-13 20:24:00,926 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 84 selfloop transitions, 45 changer transitions 1/130 dead transitions. [2025-04-13 20:24:00,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 130 transitions, 1089 flow [2025-04-13 20:24:00,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:24:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:24:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2025-04-13 20:24:00,927 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2911111111111111 [2025-04-13 20:24:00,927 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 552 flow. Second operand 15 states and 131 transitions. [2025-04-13 20:24:00,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 130 transitions, 1089 flow [2025-04-13 20:24:00,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 130 transitions, 1039 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-04-13 20:24:00,932 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 821 flow [2025-04-13 20:24:00,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=821, PETRI_PLACES=83, PETRI_TRANSITIONS=98} [2025-04-13 20:24:00,932 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2025-04-13 20:24:00,933 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 821 flow [2025-04-13 20:24:00,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 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-04-13 20:24:00,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:24:00,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:24:00,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:24:01,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:01,133 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:24:01,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:24:01,134 INFO L85 PathProgramCache]: Analyzing trace with hash -698580546, now seen corresponding path program 4 times [2025-04-13 20:24:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:24:01,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759843751] [2025-04-13 20:24:01,134 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:24:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:24:01,141 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:24:01,166 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:24:01,166 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:24:01,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:24:02,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759843751] [2025-04-13 20:24:02,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759843751] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:24:02,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329485631] [2025-04-13 20:24:02,977 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:24:02,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:02,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:24:02,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:24:02,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:24:03,057 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:24:03,079 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:24:03,080 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:24:03,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:03,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:24:03,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:24:04,194 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:24:04,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-04-13 20:24:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:24:04,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:25:00,949 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:25:00,949 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2025-04-13 20:25:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:25:01,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329485631] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:25:01,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:25:01,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 23 [2025-04-13 20:25:01,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966087411] [2025-04-13 20:25:01,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:25:01,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:25:01,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:01,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:25:01,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=490, Unknown=13, NotChecked=0, Total=600 [2025-04-13 20:25:01,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:25:01,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 98 transitions, 821 flow. Second operand has 25 states, 25 states have (on average 5.72) internal successors, (143), 25 states have internal predecessors, (143), 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-04-13 20:25:01,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:01,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:25:01,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:04,224 INFO L116 PetriNetUnfolderBase]: 952/1380 cut-off events. [2025-04-13 20:25:04,225 INFO L117 PetriNetUnfolderBase]: For 4360/4360 co-relation queries the response was YES. [2025-04-13 20:25:04,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6240 conditions, 1380 events. 952/1380 cut-off events. For 4360/4360 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4968 event pairs, 214 based on Foata normal form. 1/1381 useless extension candidates. Maximal degree in co-relation 6174. Up to 1200 conditions per place. [2025-04-13 20:25:04,231 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 89 selfloop transitions, 54 changer transitions 1/144 dead transitions. [2025-04-13 20:25:04,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 144 transitions, 1398 flow [2025-04-13 20:25:04,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:25:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:25:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 121 transitions. [2025-04-13 20:25:04,232 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31025641025641026 [2025-04-13 20:25:04,232 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 821 flow. Second operand 13 states and 121 transitions. [2025-04-13 20:25:04,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 144 transitions, 1398 flow [2025-04-13 20:25:04,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 144 transitions, 1310 flow, removed 22 selfloop flow, removed 8 redundant places. [2025-04-13 20:25:04,240 INFO L231 Difference]: Finished difference. Result has 93 places, 117 transitions, 1119 flow [2025-04-13 20:25:04,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1119, PETRI_PLACES=93, PETRI_TRANSITIONS=117} [2025-04-13 20:25:04,240 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2025-04-13 20:25:04,240 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 117 transitions, 1119 flow [2025-04-13 20:25:04,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.72) internal successors, (143), 25 states have internal predecessors, (143), 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-04-13 20:25:04,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:04,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:04,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:25:04,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:25:04,445 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:25:04,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash 88883326, now seen corresponding path program 5 times [2025-04-13 20:25:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:04,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498405799] [2025-04-13 20:25:04,446 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:25:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:04,452 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:25:04,469 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:04,470 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:25:04,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:05,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:05,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498405799] [2025-04-13 20:25:05,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498405799] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:25:05,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700220963] [2025-04-13 20:25:05,942 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:25:05,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:25:05,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:25:05,943 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:25:05,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:25:05,994 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:25:06,019 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:06,019 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:25:06,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:06,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:25:06,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:25:07,440 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:25:07,440 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:25:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:25:07,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:25:07,725 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:25:07,725 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-04-13 20:25:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:25:07,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700220963] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:25:07,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:25:07,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 22 [2025-04-13 20:25:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133031209] [2025-04-13 20:25:07,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:25:07,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:25:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:07,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:25:07,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:25:07,954 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:25:07,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 117 transitions, 1119 flow. Second operand has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 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-04-13 20:25:07,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:07,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:25:07,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:10,920 INFO L116 PetriNetUnfolderBase]: 1093/1585 cut-off events. [2025-04-13 20:25:10,920 INFO L117 PetriNetUnfolderBase]: For 6833/6833 co-relation queries the response was YES. [2025-04-13 20:25:10,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7695 conditions, 1585 events. 1093/1585 cut-off events. For 6833/6833 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6045 event pairs, 73 based on Foata normal form. 1/1586 useless extension candidates. Maximal degree in co-relation 7622. Up to 1166 conditions per place. [2025-04-13 20:25:10,929 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 91 selfloop transitions, 78 changer transitions 1/170 dead transitions. [2025-04-13 20:25:10,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 170 transitions, 1730 flow [2025-04-13 20:25:10,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:25:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:25:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 145 transitions. [2025-04-13 20:25:10,930 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2025-04-13 20:25:10,930 INFO L175 Difference]: Start difference. First operand has 93 places, 117 transitions, 1119 flow. Second operand 15 states and 145 transitions. [2025-04-13 20:25:10,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 170 transitions, 1730 flow [2025-04-13 20:25:10,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 170 transitions, 1646 flow, removed 36 selfloop flow, removed 4 redundant places. [2025-04-13 20:25:10,942 INFO L231 Difference]: Finished difference. Result has 105 places, 127 transitions, 1355 flow [2025-04-13 20:25:10,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1355, PETRI_PLACES=105, PETRI_TRANSITIONS=127} [2025-04-13 20:25:10,942 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2025-04-13 20:25:10,942 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 127 transitions, 1355 flow [2025-04-13 20:25:10,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 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-04-13 20:25:10,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:10,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:10,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 20:25:11,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 20:25:11,144 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:25:11,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:11,144 INFO L85 PathProgramCache]: Analyzing trace with hash 539722584, now seen corresponding path program 6 times [2025-04-13 20:25:11,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:11,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712884046] [2025-04-13 20:25:11,145 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:25:11,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:11,150 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:25:11,174 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:11,174 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:25:11,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:13,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712884046] [2025-04-13 20:25:13,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712884046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:25:13,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229010487] [2025-04-13 20:25:13,110 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:25:13,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:25:13,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:25:13,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:25:13,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:25:13,166 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:25:13,188 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:13,188 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:25:13,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:13,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:25:13,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:25:14,163 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:25:14,163 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:25:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:25:14,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:25:14,697 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:25:14,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-04-13 20:25:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:25:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229010487] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:25:14,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:25:14,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 20 [2025-04-13 20:25:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402346337] [2025-04-13 20:25:14,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:25:14,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:25:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:14,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:25:14,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:25:14,897 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:25:14,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 127 transitions, 1355 flow. Second operand has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 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-04-13 20:25:14,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:14,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:25:14,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:18,597 INFO L116 PetriNetUnfolderBase]: 1168/1694 cut-off events. [2025-04-13 20:25:18,598 INFO L117 PetriNetUnfolderBase]: For 8378/8378 co-relation queries the response was YES. [2025-04-13 20:25:18,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8720 conditions, 1694 events. 1168/1694 cut-off events. For 8378/8378 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6510 event pairs, 141 based on Foata normal form. 1/1695 useless extension candidates. Maximal degree in co-relation 8643. Up to 1390 conditions per place. [2025-04-13 20:25:18,610 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 102 selfloop transitions, 72 changer transitions 1/175 dead transitions. [2025-04-13 20:25:18,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 175 transitions, 1987 flow [2025-04-13 20:25:18,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:25:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:25:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. [2025-04-13 20:25:18,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2025-04-13 20:25:18,611 INFO L175 Difference]: Start difference. First operand has 105 places, 127 transitions, 1355 flow. Second operand 15 states and 138 transitions. [2025-04-13 20:25:18,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 175 transitions, 1987 flow [2025-04-13 20:25:18,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 175 transitions, 1791 flow, removed 54 selfloop flow, removed 10 redundant places. [2025-04-13 20:25:18,630 INFO L231 Difference]: Finished difference. Result has 113 places, 139 transitions, 1541 flow [2025-04-13 20:25:18,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1541, PETRI_PLACES=113, PETRI_TRANSITIONS=139} [2025-04-13 20:25:18,631 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2025-04-13 20:25:18,631 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 139 transitions, 1541 flow [2025-04-13 20:25:18,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 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-04-13 20:25:18,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:18,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:18,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:25:18,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 20:25:18,831 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:25:18,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1951904288, now seen corresponding path program 7 times [2025-04-13 20:25:18,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:18,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899309667] [2025-04-13 20:25:18,832 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:25:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:18,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:25:18,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:18,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:25:18,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:25:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:20,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899309667] [2025-04-13 20:25:20,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899309667] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:25:20,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194856084] [2025-04-13 20:25:20,202 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:25:20,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:25:20,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:25:20,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:25:20,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:25:20,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:25:20,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:20,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:25:20,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:20,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:25:20,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:25:21,253 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:25:21,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-04-13 20:25:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:25:21,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:26:33,921 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:26:33,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-04-13 20:26:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:26:34,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194856084] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:26:34,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:26:34,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 22 [2025-04-13 20:26:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329853403] [2025-04-13 20:26:34,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:26:34,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:26:34,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:26:34,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:26:34,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=440, Unknown=17, NotChecked=0, Total=552 [2025-04-13 20:26:34,086 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:26:34,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 139 transitions, 1541 flow. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 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-04-13 20:26:34,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:26:34,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:26:34,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:26:40,938 INFO L116 PetriNetUnfolderBase]: 1218/1767 cut-off events. [2025-04-13 20:26:40,938 INFO L117 PetriNetUnfolderBase]: For 9161/9161 co-relation queries the response was YES. [2025-04-13 20:26:40,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 1767 events. 1218/1767 cut-off events. For 9161/9161 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6881 event pairs, 147 based on Foata normal form. 1/1768 useless extension candidates. Maximal degree in co-relation 9169. Up to 1463 conditions per place. [2025-04-13 20:26:40,951 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 107 selfloop transitions, 74 changer transitions 1/182 dead transitions. [2025-04-13 20:26:40,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 182 transitions, 2098 flow [2025-04-13 20:26:40,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:26:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:26:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 134 transitions. [2025-04-13 20:26:40,953 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3435897435897436 [2025-04-13 20:26:40,954 INFO L175 Difference]: Start difference. First operand has 113 places, 139 transitions, 1541 flow. Second operand 13 states and 134 transitions. [2025-04-13 20:26:40,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 182 transitions, 2098 flow [2025-04-13 20:26:40,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 182 transitions, 1920 flow, removed 42 selfloop flow, removed 9 redundant places. [2025-04-13 20:26:40,972 INFO L231 Difference]: Finished difference. Result has 118 places, 144 transitions, 1611 flow [2025-04-13 20:26:40,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1611, PETRI_PLACES=118, PETRI_TRANSITIONS=144} [2025-04-13 20:26:40,972 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2025-04-13 20:26:40,972 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 144 transitions, 1611 flow [2025-04-13 20:26:40,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 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-04-13 20:26:40,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:26:40,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:26:40,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:26:41,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 20:26:41,173 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:26:41,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:26:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1197055148, now seen corresponding path program 8 times [2025-04-13 20:26:41,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:26:41,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408972000] [2025-04-13 20:26:41,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:26:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:26:41,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:26:41,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:26:41,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:26:41,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:26:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:26:42,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408972000] [2025-04-13 20:26:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408972000] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:26:42,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074797230] [2025-04-13 20:26:42,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:26:42,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:26:42,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:26:42,757 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:26:42,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:26:42,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:26:42,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:26:42,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:26:42,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:42,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 20:26:42,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:26:42,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:26:43,146 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:26:43,146 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:26:43,771 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-13 20:26:43,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:26:44,469 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:26:44,470 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 94 [2025-04-13 20:26:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:26:44,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:26:47,126 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:26:47,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 40 [2025-04-13 20:26:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:26:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074797230] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:26:47,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:26:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 25 [2025-04-13 20:26:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144600716] [2025-04-13 20:26:47,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:26:47,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:26:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:26:47,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:26:47,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:26:47,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:26:47,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 144 transitions, 1611 flow. Second operand has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 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-04-13 20:26:47,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:26:47,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:26:47,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:26:51,212 INFO L116 PetriNetUnfolderBase]: 1340/1942 cut-off events. [2025-04-13 20:26:51,212 INFO L117 PetriNetUnfolderBase]: For 11533/11533 co-relation queries the response was YES. [2025-04-13 20:26:51,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10164 conditions, 1942 events. 1340/1942 cut-off events. For 11533/11533 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7757 event pairs, 145 based on Foata normal form. 1/1943 useless extension candidates. Maximal degree in co-relation 10080. Up to 1570 conditions per place. [2025-04-13 20:26:51,222 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 111 selfloop transitions, 78 changer transitions 1/190 dead transitions. [2025-04-13 20:26:51,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 190 transitions, 2260 flow [2025-04-13 20:26:51,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:26:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:26:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 139 transitions. [2025-04-13 20:26:51,223 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3088888888888889 [2025-04-13 20:26:51,223 INFO L175 Difference]: Start difference. First operand has 118 places, 144 transitions, 1611 flow. Second operand 15 states and 139 transitions. [2025-04-13 20:26:51,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 190 transitions, 2260 flow [2025-04-13 20:26:51,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 190 transitions, 2052 flow, removed 30 selfloop flow, removed 12 redundant places. [2025-04-13 20:26:51,242 INFO L231 Difference]: Finished difference. Result has 122 places, 154 transitions, 1745 flow [2025-04-13 20:26:51,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1745, PETRI_PLACES=122, PETRI_TRANSITIONS=154} [2025-04-13 20:26:51,243 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2025-04-13 20:26:51,243 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 154 transitions, 1745 flow [2025-04-13 20:26:51,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 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-04-13 20:26:51,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:26:51,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:26:51,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:26:51,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 20:26:51,443 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:26:51,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:26:51,444 INFO L85 PathProgramCache]: Analyzing trace with hash 434945612, now seen corresponding path program 9 times [2025-04-13 20:26:51,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:26:51,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918008863] [2025-04-13 20:26:51,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:26:51,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:26:51,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:26:51,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:26:51,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:26:51,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:26:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:26:52,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918008863] [2025-04-13 20:26:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918008863] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:26:52,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527128184] [2025-04-13 20:26:52,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:26:52,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:26:52,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:26:52,737 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:26:52,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:26:52,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:26:52,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:26:52,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:26:52,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:52,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 20:26:52,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:26:52,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:26:53,083 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:26:53,083 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:26:53,697 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-13 20:26:53,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:26:54,179 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:26:54,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 96 [2025-04-13 20:26:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:26:54,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:26:57,080 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:26:57,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 40 [2025-04-13 20:26:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:26:57,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527128184] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:26:57,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:26:57,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 22 [2025-04-13 20:26:57,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314719330] [2025-04-13 20:26:57,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:26:57,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:26:57,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:26:57,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:26:57,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:26:57,711 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:26:57,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 154 transitions, 1745 flow. Second operand has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 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-04-13 20:26:57,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:26:57,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:26:57,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:00,770 INFO L116 PetriNetUnfolderBase]: 1414/2049 cut-off events. [2025-04-13 20:27:00,770 INFO L117 PetriNetUnfolderBase]: For 12934/12934 co-relation queries the response was YES. [2025-04-13 20:27:00,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10874 conditions, 2049 events. 1414/2049 cut-off events. For 12934/12934 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8303 event pairs, 172 based on Foata normal form. 1/2050 useless extension candidates. Maximal degree in co-relation 10790. Up to 1747 conditions per place. [2025-04-13 20:27:00,781 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 122 selfloop transitions, 72 changer transitions 1/195 dead transitions. [2025-04-13 20:27:00,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 195 transitions, 2361 flow [2025-04-13 20:27:00,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:27:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:27:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2025-04-13 20:27:00,783 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33589743589743587 [2025-04-13 20:27:00,783 INFO L175 Difference]: Start difference. First operand has 122 places, 154 transitions, 1745 flow. Second operand 13 states and 131 transitions. [2025-04-13 20:27:00,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 195 transitions, 2361 flow [2025-04-13 20:27:00,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 195 transitions, 2129 flow, removed 74 selfloop flow, removed 10 redundant places. [2025-04-13 20:27:00,814 INFO L231 Difference]: Finished difference. Result has 126 places, 160 transitions, 1800 flow [2025-04-13 20:27:00,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1800, PETRI_PLACES=126, PETRI_TRANSITIONS=160} [2025-04-13 20:27:00,816 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2025-04-13 20:27:00,816 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 160 transitions, 1800 flow [2025-04-13 20:27:00,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 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-04-13 20:27:00,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:00,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:00,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 20:27:01,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:27:01,018 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:27:01,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash -846582516, now seen corresponding path program 10 times [2025-04-13 20:27:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:01,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103375641] [2025-04-13 20:27:01,018 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:01,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:01,024 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:27:01,039 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:27:01,039 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:01,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:02,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:02,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103375641] [2025-04-13 20:27:02,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103375641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:02,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592838314] [2025-04-13 20:27:02,504 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:02,506 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:02,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:27:02,563 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:27:02,585 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:27:02,586 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:27:02,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:02,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:27:02,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:03,623 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:27:03,623 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-04-13 20:27:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:27:03,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:08,195 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:27:08,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-13 20:27:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:27:08,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592838314] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:08,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:08,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 23 [2025-04-13 20:27:08,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057729135] [2025-04-13 20:27:08,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:08,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:27:08,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:08,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:27:08,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=502, Unknown=1, NotChecked=0, Total=600 [2025-04-13 20:27:08,646 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:27:08,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 160 transitions, 1800 flow. Second operand has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 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-04-13 20:27:08,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:08,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:27:08,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:11,407 INFO L116 PetriNetUnfolderBase]: 1630/2361 cut-off events. [2025-04-13 20:27:11,408 INFO L117 PetriNetUnfolderBase]: For 16718/16718 co-relation queries the response was YES. [2025-04-13 20:27:11,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12967 conditions, 2361 events. 1630/2361 cut-off events. For 16718/16718 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9820 event pairs, 403 based on Foata normal form. 1/2362 useless extension candidates. Maximal degree in co-relation 12880. Up to 2060 conditions per place. [2025-04-13 20:27:11,421 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 156 selfloop transitions, 71 changer transitions 1/228 dead transitions. [2025-04-13 20:27:11,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 228 transitions, 2911 flow [2025-04-13 20:27:11,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:27:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:27:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2025-04-13 20:27:11,422 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2025-04-13 20:27:11,422 INFO L175 Difference]: Start difference. First operand has 126 places, 160 transitions, 1800 flow. Second operand 13 states and 132 transitions. [2025-04-13 20:27:11,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 228 transitions, 2911 flow [2025-04-13 20:27:11,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 228 transitions, 2671 flow, removed 30 selfloop flow, removed 10 redundant places. [2025-04-13 20:27:11,451 INFO L231 Difference]: Finished difference. Result has 132 places, 191 transitions, 2324 flow [2025-04-13 20:27:11,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2324, PETRI_PLACES=132, PETRI_TRANSITIONS=191} [2025-04-13 20:27:11,452 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 102 predicate places. [2025-04-13 20:27:11,452 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 191 transitions, 2324 flow [2025-04-13 20:27:11,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 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-04-13 20:27:11,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:11,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:11,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 20:27:11,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 20:27:11,653 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:27:11,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1185958304, now seen corresponding path program 11 times [2025-04-13 20:27:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:11,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095498738] [2025-04-13 20:27:11,653 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:27:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:11,658 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:27:11,664 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:27:11,664 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:11,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:12,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:12,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095498738] [2025-04-13 20:27:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095498738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:12,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259314671] [2025-04-13 20:27:12,980 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:27:12,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:12,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:12,982 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:12,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:27:13,045 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:27:13,070 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:27:13,071 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:27:13,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:13,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:27:13,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:14,575 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:27:14,575 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:27:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:27:14,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:14,969 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:27:14,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-13 20:27:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:27:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259314671] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:15,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:15,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 24 [2025-04-13 20:27:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834482055] [2025-04-13 20:27:15,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:15,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:27:15,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:15,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:27:15,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:27:15,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:27:15,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 191 transitions, 2324 flow. Second operand has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 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-04-13 20:27:15,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:15,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:27:15,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:19,731 INFO L116 PetriNetUnfolderBase]: 1771/2566 cut-off events. [2025-04-13 20:27:19,731 INFO L117 PetriNetUnfolderBase]: For 21720/21720 co-relation queries the response was YES. [2025-04-13 20:27:19,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14533 conditions, 2566 events. 1771/2566 cut-off events. For 21720/21720 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10871 event pairs, 476 based on Foata normal form. 1/2567 useless extension candidates. Maximal degree in co-relation 14442. Up to 2291 conditions per place. [2025-04-13 20:27:19,746 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 180 selfloop transitions, 67 changer transitions 1/248 dead transitions. [2025-04-13 20:27:19,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 248 transitions, 3291 flow [2025-04-13 20:27:19,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:27:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:27:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 140 transitions. [2025-04-13 20:27:19,747 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2025-04-13 20:27:19,747 INFO L175 Difference]: Start difference. First operand has 132 places, 191 transitions, 2324 flow. Second operand 15 states and 140 transitions. [2025-04-13 20:27:19,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 248 transitions, 3291 flow [2025-04-13 20:27:19,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 248 transitions, 3092 flow, removed 89 selfloop flow, removed 5 redundant places. [2025-04-13 20:27:19,792 INFO L231 Difference]: Finished difference. Result has 145 places, 209 transitions, 2677 flow [2025-04-13 20:27:19,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2677, PETRI_PLACES=145, PETRI_TRANSITIONS=209} [2025-04-13 20:27:19,793 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2025-04-13 20:27:19,793 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 209 transitions, 2677 flow [2025-04-13 20:27:19,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 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-04-13 20:27:19,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:19,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:19,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 20:27:19,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:19,994 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:27:19,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1890924910, now seen corresponding path program 12 times [2025-04-13 20:27:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:19,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864385642] [2025-04-13 20:27:19,995 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:27:19,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:20,016 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:27:20,037 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:27:20,037 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:27:20,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:21,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:21,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864385642] [2025-04-13 20:27:21,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864385642] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:21,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881225466] [2025-04-13 20:27:21,870 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:27:21,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:21,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:21,872 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:21,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:27:21,926 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:27:21,946 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:27:21,946 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:27:21,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:21,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:27:21,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:23,041 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:27:23,041 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:27:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:27:23,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:27:23,566 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:27:23,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-13 20:27:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:27:24,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881225466] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:27:24,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:27:24,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 21 [2025-04-13 20:27:24,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772896006] [2025-04-13 20:27:24,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:27:24,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:27:24,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:24,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:27:24,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:27:24,050 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:27:24,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 209 transitions, 2677 flow. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 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-04-13 20:27:24,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:24,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:27:24,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:27,617 INFO L116 PetriNetUnfolderBase]: 1940/2811 cut-off events. [2025-04-13 20:27:27,618 INFO L117 PetriNetUnfolderBase]: For 26476/26476 co-relation queries the response was YES. [2025-04-13 20:27:27,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16103 conditions, 2811 events. 1940/2811 cut-off events. For 26476/26476 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 12177 event pairs, 514 based on Foata normal form. 1/2812 useless extension candidates. Maximal degree in co-relation 16007. Up to 2561 conditions per place. [2025-04-13 20:27:27,632 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 200 selfloop transitions, 59 changer transitions 1/260 dead transitions. [2025-04-13 20:27:27,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 260 transitions, 3618 flow [2025-04-13 20:27:27,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:27:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:27:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 139 transitions. [2025-04-13 20:27:27,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3088888888888889 [2025-04-13 20:27:27,634 INFO L175 Difference]: Start difference. First operand has 145 places, 209 transitions, 2677 flow. Second operand 15 states and 139 transitions. [2025-04-13 20:27:27,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 260 transitions, 3618 flow [2025-04-13 20:27:27,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 260 transitions, 3388 flow, removed 103 selfloop flow, removed 7 redundant places. [2025-04-13 20:27:27,680 INFO L231 Difference]: Finished difference. Result has 155 places, 222 transitions, 2879 flow [2025-04-13 20:27:27,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2447, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2879, PETRI_PLACES=155, PETRI_TRANSITIONS=222} [2025-04-13 20:27:27,680 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2025-04-13 20:27:27,680 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 222 transitions, 2879 flow [2025-04-13 20:27:27,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 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-04-13 20:27:27,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:27,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:27,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 20:27:27,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:27,881 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:27:27,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash 555600644, now seen corresponding path program 13 times [2025-04-13 20:27:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:27,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859195190] [2025-04-13 20:27:27,882 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:27:27,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:27,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:27:27,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:27:27,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:27,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:27:29,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:29,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859195190] [2025-04-13 20:27:29,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859195190] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:27:29,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343094163] [2025-04-13 20:27:29,068 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:27:29,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:27:29,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:27:29,070 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:27:29,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 20:27:29,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:27:29,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:27:29,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:27:29,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:29,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:27:29,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:27:29,936 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:27:29,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-04-13 20:27:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:27:29,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:26,761 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:28:26,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-13 20:28:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:28:27,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343094163] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:27,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:27,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 22 [2025-04-13 20:28:27,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225699131] [2025-04-13 20:28:27,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:27,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:28:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:27,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:28:27,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=441, Unknown=14, NotChecked=0, Total=552 [2025-04-13 20:28:27,219 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:28:27,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 222 transitions, 2879 flow. Second operand has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 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-04-13 20:28:27,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:27,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:28:27,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:29,877 INFO L116 PetriNetUnfolderBase]: 2025/2934 cut-off events. [2025-04-13 20:28:29,877 INFO L117 PetriNetUnfolderBase]: For 28163/28163 co-relation queries the response was YES. [2025-04-13 20:28:29,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16699 conditions, 2934 events. 2025/2934 cut-off events. For 28163/28163 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12808 event pairs, 570 based on Foata normal form. 1/2935 useless extension candidates. Maximal degree in co-relation 16599. Up to 2747 conditions per place. [2025-04-13 20:28:29,892 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 204 selfloop transitions, 59 changer transitions 1/264 dead transitions. [2025-04-13 20:28:29,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 264 transitions, 3752 flow [2025-04-13 20:28:29,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:28:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:28:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 127 transitions. [2025-04-13 20:28:29,893 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32564102564102565 [2025-04-13 20:28:29,893 INFO L175 Difference]: Start difference. First operand has 155 places, 222 transitions, 2879 flow. Second operand 13 states and 127 transitions. [2025-04-13 20:28:29,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 264 transitions, 3752 flow [2025-04-13 20:28:29,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 264 transitions, 3360 flow, removed 167 selfloop flow, removed 9 redundant places. [2025-04-13 20:28:29,950 INFO L231 Difference]: Finished difference. Result has 161 places, 232 transitions, 2880 flow [2025-04-13 20:28:29,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2581, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2880, PETRI_PLACES=161, PETRI_TRANSITIONS=232} [2025-04-13 20:28:29,950 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2025-04-13 20:28:29,950 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 232 transitions, 2880 flow [2025-04-13 20:28:29,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 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-04-13 20:28:29,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:29,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:29,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 20:28:30,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:30,151 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:28:30,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:30,151 INFO L85 PathProgramCache]: Analyzing trace with hash 721117938, now seen corresponding path program 14 times [2025-04-13 20:28:30,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:30,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47336315] [2025-04-13 20:28:30,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:28:30,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:30,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:28:30,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:28:30,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:30,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:31,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47336315] [2025-04-13 20:28:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47336315] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:31,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890233025] [2025-04-13 20:28:31,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:28:31,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:31,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:31,810 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:28:31,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 20:28:31,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:28:31,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:28:31,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:31,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:31,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 20:28:31,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:31,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:28:32,092 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-13 20:28:32,092 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-13 20:28:32,316 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:28:32,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:28:33,045 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-13 20:28:33,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:28:33,555 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:28:33,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 96 [2025-04-13 20:28:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:28:33,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:35,698 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:28:35,699 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2025-04-13 20:28:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:28:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890233025] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:37,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:37,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 25 [2025-04-13 20:28:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855064499] [2025-04-13 20:28:37,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:37,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:28:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:37,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:28:37,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:28:37,080 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:28:37,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 232 transitions, 2880 flow. Second operand has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 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-04-13 20:28:37,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:37,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:28:37,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:40,862 INFO L116 PetriNetUnfolderBase]: 2095/3035 cut-off events. [2025-04-13 20:28:40,863 INFO L117 PetriNetUnfolderBase]: For 28043/28043 co-relation queries the response was YES. [2025-04-13 20:28:40,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16662 conditions, 3035 events. 2095/3035 cut-off events. For 28043/28043 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13341 event pairs, 602 based on Foata normal form. 1/3036 useless extension candidates. Maximal degree in co-relation 16558. Up to 2855 conditions per place. [2025-04-13 20:28:40,878 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 208 selfloop transitions, 59 changer transitions 1/268 dead transitions. [2025-04-13 20:28:40,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 268 transitions, 3678 flow [2025-04-13 20:28:40,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:28:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:28:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2025-04-13 20:28:40,880 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2911111111111111 [2025-04-13 20:28:40,880 INFO L175 Difference]: Start difference. First operand has 161 places, 232 transitions, 2880 flow. Second operand 15 states and 131 transitions. [2025-04-13 20:28:40,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 268 transitions, 3678 flow [2025-04-13 20:28:40,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 268 transitions, 3474 flow, removed 48 selfloop flow, removed 9 redundant places. [2025-04-13 20:28:40,927 INFO L231 Difference]: Finished difference. Result has 168 places, 238 transitions, 2978 flow [2025-04-13 20:28:40,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2676, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2978, PETRI_PLACES=168, PETRI_TRANSITIONS=238} [2025-04-13 20:28:40,928 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 138 predicate places. [2025-04-13 20:28:40,928 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 238 transitions, 2978 flow [2025-04-13 20:28:40,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 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-04-13 20:28:40,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:40,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:40,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 20:28:41,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:41,129 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:28:41,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1730292528, now seen corresponding path program 15 times [2025-04-13 20:28:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:41,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276851009] [2025-04-13 20:28:41,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:28:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:41,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:28:41,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:28:41,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:28:41,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:28:42,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:42,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276851009] [2025-04-13 20:28:42,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276851009] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:42,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151214942] [2025-04-13 20:28:42,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:28:42,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:42,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:42,460 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:28:42,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 20:28:42,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:28:42,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:28:42,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:28:42,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:42,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:28:42,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:43,531 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:28:43,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:28:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:28:43,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:44,055 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:28:44,055 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-13 20:28:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:28:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151214942] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:44,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:44,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 19 [2025-04-13 20:28:44,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506578320] [2025-04-13 20:28:44,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:44,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 20:28:44,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:44,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 20:28:44,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-04-13 20:28:44,497 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:28:44,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 238 transitions, 2978 flow. Second operand has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 21 states have internal predecessors, (120), 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-04-13 20:28:44,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:44,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:28:44,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:47,125 INFO L116 PetriNetUnfolderBase]: 2170/3144 cut-off events. [2025-04-13 20:28:47,125 INFO L117 PetriNetUnfolderBase]: For 30540/30540 co-relation queries the response was YES. [2025-04-13 20:28:47,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17232 conditions, 3144 events. 2170/3144 cut-off events. For 30540/30540 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13999 event pairs, 622 based on Foata normal form. 1/3145 useless extension candidates. Maximal degree in co-relation 17126. Up to 2947 conditions per place. [2025-04-13 20:28:47,146 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 214 selfloop transitions, 64 changer transitions 1/279 dead transitions. [2025-04-13 20:28:47,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 279 transitions, 3775 flow [2025-04-13 20:28:47,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:28:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:28:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions. [2025-04-13 20:28:47,147 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33076923076923076 [2025-04-13 20:28:47,147 INFO L175 Difference]: Start difference. First operand has 168 places, 238 transitions, 2978 flow. Second operand 13 states and 129 transitions. [2025-04-13 20:28:47,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 279 transitions, 3775 flow [2025-04-13 20:28:47,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 279 transitions, 3561 flow, removed 72 selfloop flow, removed 11 redundant places. [2025-04-13 20:28:47,228 INFO L231 Difference]: Finished difference. Result has 172 places, 245 transitions, 3060 flow [2025-04-13 20:28:47,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2764, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3060, PETRI_PLACES=172, PETRI_TRANSITIONS=245} [2025-04-13 20:28:47,229 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2025-04-13 20:28:47,229 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 245 transitions, 3060 flow [2025-04-13 20:28:47,229 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 21 states have internal predecessors, (120), 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-04-13 20:28:47,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:47,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:47,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 20:28:47,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:47,430 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:28:47,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1424725490, now seen corresponding path program 16 times [2025-04-13 20:28:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:47,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160547157] [2025-04-13 20:28:47,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:28:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:47,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:28:47,450 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:28:47,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:28:47,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:28:48,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:48,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160547157] [2025-04-13 20:28:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160547157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:48,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962613127] [2025-04-13 20:28:48,804 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:28:48,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:48,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:48,806 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:28:48,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 20:28:48,863 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:28:48,886 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:28:48,886 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:28:48,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:48,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 20:28:48,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:48,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:28:49,127 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:28:49,128 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:28:49,968 INFO L325 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-04-13 20:28:49,969 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:28:50,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-04-13 20:28:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:28:50,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:54,474 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse1 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 ~B~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)))) (= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~B~0.base) (+ ~B~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4)))) (+ .cse1 c_~csum~0 .cse2))))) is different from false [2025-04-13 20:28:58,508 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int#1| c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select |c_#memory_int#1| c_~B~0.base) ~B~0.offset))) (= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ ~B~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))))))) is different from false [2025-04-13 20:28:58,729 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:28:58,729 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2025-04-13 20:29:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-04-13 20:29:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962613127] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:29:00,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:29:00,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2025-04-13 20:29:00,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524632498] [2025-04-13 20:29:00,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:29:00,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 20:29:00,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:00,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 20:29:00,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=634, Unknown=2, NotChecked=106, Total=870 [2025-04-13 20:29:00,542 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:29:00,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 245 transitions, 3060 flow. Second operand has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 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-04-13 20:29:00,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:00,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:29:00,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:29:04,899 INFO L116 PetriNetUnfolderBase]: 2244/3251 cut-off events. [2025-04-13 20:29:04,899 INFO L117 PetriNetUnfolderBase]: For 32406/32406 co-relation queries the response was YES. [2025-04-13 20:29:04,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17963 conditions, 3251 events. 2244/3251 cut-off events. For 32406/32406 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 14559 event pairs, 645 based on Foata normal form. 1/3252 useless extension candidates. Maximal degree in co-relation 17853. Up to 3056 conditions per place. [2025-04-13 20:29:04,924 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 219 selfloop transitions, 64 changer transitions 1/284 dead transitions. [2025-04-13 20:29:04,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 284 transitions, 3872 flow [2025-04-13 20:29:04,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:29:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:29:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 128 transitions. [2025-04-13 20:29:04,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3282051282051282 [2025-04-13 20:29:04,925 INFO L175 Difference]: Start difference. First operand has 172 places, 245 transitions, 3060 flow. Second operand 13 states and 128 transitions. [2025-04-13 20:29:04,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 284 transitions, 3872 flow [2025-04-13 20:29:04,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 284 transitions, 3662 flow, removed 46 selfloop flow, removed 9 redundant places. [2025-04-13 20:29:04,977 INFO L231 Difference]: Finished difference. Result has 177 places, 251 transitions, 3139 flow [2025-04-13 20:29:04,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2850, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3139, PETRI_PLACES=177, PETRI_TRANSITIONS=251} [2025-04-13 20:29:04,977 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2025-04-13 20:29:04,977 INFO L485 AbstractCegarLoop]: Abstraction has has 177 places, 251 transitions, 3139 flow [2025-04-13 20:29:04,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 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-04-13 20:29:04,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:04,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:04,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 20:29:05,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:05,179 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:29:05,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:05,180 INFO L85 PathProgramCache]: Analyzing trace with hash -432965466, now seen corresponding path program 17 times [2025-04-13 20:29:05,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:05,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976450608] [2025-04-13 20:29:05,180 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:29:05,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:05,185 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:29:05,193 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:29:05,193 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:29:05,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:29:06,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:06,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976450608] [2025-04-13 20:29:06,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976450608] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:06,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870374585] [2025-04-13 20:29:06,473 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:29:06,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:06,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:06,475 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:29:06,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 20:29:06,535 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:29:06,555 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:29:06,555 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:29:06,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:06,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:29:06,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:08,660 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:29:08,661 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:29:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:29:08,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:09,143 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:29:09,143 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-13 20:29:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:29:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870374585] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:29:09,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:29:09,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 23 [2025-04-13 20:29:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664196477] [2025-04-13 20:29:09,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:29:09,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:29:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:09,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:29:09,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:29:09,924 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:29:09,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 251 transitions, 3139 flow. Second operand has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 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-04-13 20:29:09,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:09,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:29:09,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:29:14,192 INFO L116 PetriNetUnfolderBase]: 2329/3374 cut-off events. [2025-04-13 20:29:14,193 INFO L117 PetriNetUnfolderBase]: For 35583/35583 co-relation queries the response was YES. [2025-04-13 20:29:14,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18664 conditions, 3374 events. 2329/3374 cut-off events. For 35583/35583 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15306 event pairs, 688 based on Foata normal form. 1/3375 useless extension candidates. Maximal degree in co-relation 18552. Up to 3213 conditions per place. [2025-04-13 20:29:14,211 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 229 selfloop transitions, 57 changer transitions 1/287 dead transitions. [2025-04-13 20:29:14,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 287 transitions, 3964 flow [2025-04-13 20:29:14,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:29:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:29:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 121 transitions. [2025-04-13 20:29:14,212 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31025641025641026 [2025-04-13 20:29:14,212 INFO L175 Difference]: Start difference. First operand has 177 places, 251 transitions, 3139 flow. Second operand 13 states and 121 transitions. [2025-04-13 20:29:14,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 287 transitions, 3964 flow [2025-04-13 20:29:14,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 287 transitions, 3734 flow, removed 54 selfloop flow, removed 10 redundant places. [2025-04-13 20:29:14,269 INFO L231 Difference]: Finished difference. Result has 183 places, 261 transitions, 3246 flow [2025-04-13 20:29:14,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2911, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3246, PETRI_PLACES=183, PETRI_TRANSITIONS=261} [2025-04-13 20:29:14,270 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2025-04-13 20:29:14,270 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 261 transitions, 3246 flow [2025-04-13 20:29:14,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 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-04-13 20:29:14,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:14,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:14,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 20:29:14,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-13 20:29:14,471 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:29:14,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:14,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1916100404, now seen corresponding path program 18 times [2025-04-13 20:29:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:14,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974117720] [2025-04-13 20:29:14,471 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:29:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:14,476 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:29:14,494 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:29:14,495 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:29:14,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:16,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:16,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974117720] [2025-04-13 20:29:16,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974117720] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:16,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679872601] [2025-04-13 20:29:16,502 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:29:16,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:16,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:16,504 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:29:16,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 20:29:16,568 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:29:16,589 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:29:16,589 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:29:16,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:16,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:29:16,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:17,967 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:29:17,967 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:29:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:29:18,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:18,542 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:29:18,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-13 20:29:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:29:19,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679872601] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:29:19,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:29:19,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 20 [2025-04-13 20:29:19,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343243023] [2025-04-13 20:29:19,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:29:19,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:29:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:19,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:29:19,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:29:19,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:29:19,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 261 transitions, 3246 flow. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 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-04-13 20:29:19,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:19,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:29:19,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:29:23,522 INFO L116 PetriNetUnfolderBase]: 2414/3497 cut-off events. [2025-04-13 20:29:23,522 INFO L117 PetriNetUnfolderBase]: For 39087/39087 co-relation queries the response was YES. [2025-04-13 20:29:23,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19382 conditions, 3497 events. 2414/3497 cut-off events. For 39087/39087 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15958 event pairs, 724 based on Foata normal form. 1/3498 useless extension candidates. Maximal degree in co-relation 19266. Up to 3336 conditions per place. [2025-04-13 20:29:23,544 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 241 selfloop transitions, 57 changer transitions 1/299 dead transitions. [2025-04-13 20:29:23,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 299 transitions, 4121 flow [2025-04-13 20:29:23,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:29:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:29:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 129 transitions. [2025-04-13 20:29:23,544 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2866666666666667 [2025-04-13 20:29:23,545 INFO L175 Difference]: Start difference. First operand has 183 places, 261 transitions, 3246 flow. Second operand 15 states and 129 transitions. [2025-04-13 20:29:23,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 299 transitions, 4121 flow [2025-04-13 20:29:23,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 299 transitions, 3911 flow, removed 54 selfloop flow, removed 8 redundant places. [2025-04-13 20:29:23,612 INFO L231 Difference]: Finished difference. Result has 193 places, 271 transitions, 3394 flow [2025-04-13 20:29:23,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3038, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3394, PETRI_PLACES=193, PETRI_TRANSITIONS=271} [2025-04-13 20:29:23,613 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2025-04-13 20:29:23,613 INFO L485 AbstractCegarLoop]: Abstraction has has 193 places, 271 transitions, 3394 flow [2025-04-13 20:29:23,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 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-04-13 20:29:23,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:23,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:23,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 20:29:23,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 20:29:23,814 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:29:23,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1694100754, now seen corresponding path program 19 times [2025-04-13 20:29:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:23,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058361374] [2025-04-13 20:29:23,814 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:29:23,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:23,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:29:23,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:29:23,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:29:23,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:29:25,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:25,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058361374] [2025-04-13 20:29:25,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058361374] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:25,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268870665] [2025-04-13 20:29:25,971 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:29:25,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:25,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:25,973 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:29:25,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 20:29:26,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:29:26,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:29:26,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:29:26,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:26,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 20:29:26,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:26,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:29:26,284 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-13 20:29:26,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-13 20:29:26,558 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-13 20:29:26,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 20:29:27,752 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 20:29:27,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-13 20:29:28,310 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:29:28,310 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2025-04-13 20:29:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:29:28,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:28,895 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:29:28,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 215 [2025-04-13 20:29:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:29:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268870665] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:29:31,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:29:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-04-13 20:29:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816422859] [2025-04-13 20:29:31,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:29:31,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:29:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:31,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:29:31,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:29:31,431 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:29:31,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 271 transitions, 3394 flow. Second operand has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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-04-13 20:29:31,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:31,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:29:31,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:29:35,974 INFO L116 PetriNetUnfolderBase]: 2498/3618 cut-off events. [2025-04-13 20:29:35,974 INFO L117 PetriNetUnfolderBase]: For 44286/44286 co-relation queries the response was YES. [2025-04-13 20:29:35,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20296 conditions, 3618 events. 2498/3618 cut-off events. For 44286/44286 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 16618 event pairs, 746 based on Foata normal form. 1/3619 useless extension candidates. Maximal degree in co-relation 20176. Up to 3459 conditions per place. [2025-04-13 20:29:35,994 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 249 selfloop transitions, 57 changer transitions 1/307 dead transitions. [2025-04-13 20:29:35,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 307 transitions, 4359 flow [2025-04-13 20:29:35,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:29:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:29:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 128 transitions. [2025-04-13 20:29:35,995 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28444444444444444 [2025-04-13 20:29:35,995 INFO L175 Difference]: Start difference. First operand has 193 places, 271 transitions, 3394 flow. Second operand 15 states and 128 transitions. [2025-04-13 20:29:35,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 307 transitions, 4359 flow [2025-04-13 20:29:36,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 307 transitions, 4133 flow, removed 63 selfloop flow, removed 10 redundant places. [2025-04-13 20:29:36,072 INFO L231 Difference]: Finished difference. Result has 199 places, 280 transitions, 3578 flow [2025-04-13 20:29:36,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3578, PETRI_PLACES=199, PETRI_TRANSITIONS=280} [2025-04-13 20:29:36,072 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 169 predicate places. [2025-04-13 20:29:36,073 INFO L485 AbstractCegarLoop]: Abstraction has has 199 places, 280 transitions, 3578 flow [2025-04-13 20:29:36,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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-04-13 20:29:36,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:36,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:36,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 20:29:36,273 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:29:36,273 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:29:36,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:36,274 INFO L85 PathProgramCache]: Analyzing trace with hash 436837388, now seen corresponding path program 20 times [2025-04-13 20:29:36,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:36,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81203935] [2025-04-13 20:29:36,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:29:36,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:36,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:29:36,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:29:36,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:29:36,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:29:38,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:38,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81203935] [2025-04-13 20:29:38,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81203935] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:38,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516665174] [2025-04-13 20:29:38,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:29:38,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:38,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:38,449 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:29:38,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 20:29:38,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:29:38,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:29:38,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:29:38,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:38,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 20:29:38,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:38,551 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:29:38,844 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-13 20:29:38,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-13 20:29:39,128 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:29:39,128 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:29:40,078 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-13 20:29:40,079 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:29:40,606 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:29:40,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 96 [2025-04-13 20:29:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:29:40,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:45,629 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:29:45,630 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 134 [2025-04-13 20:29:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:29:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516665174] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:29:47,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:29:47,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2025-04-13 20:29:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275164520] [2025-04-13 20:29:47,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:29:47,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:29:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:47,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:29:47,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:29:47,717 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:29:47,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 280 transitions, 3578 flow. Second operand has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 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-04-13 20:29:47,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:47,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:29:47,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:29:51,898 INFO L116 PetriNetUnfolderBase]: 2568/3719 cut-off events. [2025-04-13 20:29:51,899 INFO L117 PetriNetUnfolderBase]: For 49256/49256 co-relation queries the response was YES. [2025-04-13 20:29:51,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21015 conditions, 3719 events. 2568/3719 cut-off events. For 49256/49256 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 17208 event pairs, 772 based on Foata normal form. 1/3720 useless extension candidates. Maximal degree in co-relation 20893. Up to 3565 conditions per place. [2025-04-13 20:29:51,919 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 254 selfloop transitions, 57 changer transitions 1/312 dead transitions. [2025-04-13 20:29:51,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 312 transitions, 4504 flow [2025-04-13 20:29:51,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:29:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:29:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 121 transitions. [2025-04-13 20:29:51,920 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31025641025641026 [2025-04-13 20:29:51,920 INFO L175 Difference]: Start difference. First operand has 199 places, 280 transitions, 3578 flow. Second operand 13 states and 121 transitions. [2025-04-13 20:29:51,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 312 transitions, 4504 flow [2025-04-13 20:29:52,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 312 transitions, 4196 flow, removed 123 selfloop flow, removed 10 redundant places. [2025-04-13 20:29:52,007 INFO L231 Difference]: Finished difference. Result has 203 places, 286 transitions, 3632 flow [2025-04-13 20:29:52,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3270, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3632, PETRI_PLACES=203, PETRI_TRANSITIONS=286} [2025-04-13 20:29:52,008 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2025-04-13 20:29:52,008 INFO L485 AbstractCegarLoop]: Abstraction has has 203 places, 286 transitions, 3632 flow [2025-04-13 20:29:52,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 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-04-13 20:29:52,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:52,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:52,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 20:29:52,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:52,209 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:29:52,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash -415467542, now seen corresponding path program 21 times [2025-04-13 20:29:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:52,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473747204] [2025-04-13 20:29:52,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:29:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:52,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:29:52,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:29:52,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:29:52,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:29:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:54,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473747204] [2025-04-13 20:29:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473747204] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:54,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810429728] [2025-04-13 20:29:54,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:29:54,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:54,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:54,550 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:29:54,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 20:29:54,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:29:54,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:29:54,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:29:54,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:54,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 20:29:54,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:54,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:29:54,987 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-13 20:29:54,988 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-13 20:29:55,365 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-13 20:29:55,366 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 20:29:56,276 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:29:56,276 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-13 20:29:57,087 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:29:57,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2025-04-13 20:29:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:29:57,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:57,727 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:29:57,727 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 215 [2025-04-13 20:30:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:30:01,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810429728] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:01,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:01,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2025-04-13 20:30:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609016270] [2025-04-13 20:30:01,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:01,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:30:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:01,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:30:01,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:30:01,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:30:01,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 286 transitions, 3632 flow. Second operand has 27 states, 27 states have (on average 5.111111111111111) internal successors, (138), 27 states have internal predecessors, (138), 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-04-13 20:30:01,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:01,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:30:01,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:06,293 INFO L116 PetriNetUnfolderBase]: 2638/3820 cut-off events. [2025-04-13 20:30:06,293 INFO L117 PetriNetUnfolderBase]: For 54100/54100 co-relation queries the response was YES. [2025-04-13 20:30:06,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21629 conditions, 3820 events. 2638/3820 cut-off events. For 54100/54100 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 17808 event pairs, 807 based on Foata normal form. 1/3821 useless extension candidates. Maximal degree in co-relation 21504. Up to 3666 conditions per place. [2025-04-13 20:30:06,340 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 260 selfloop transitions, 57 changer transitions 1/318 dead transitions. [2025-04-13 20:30:06,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 318 transitions, 4582 flow [2025-04-13 20:30:06,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:30:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:30:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2025-04-13 20:30:06,342 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2822222222222222 [2025-04-13 20:30:06,342 INFO L175 Difference]: Start difference. First operand has 203 places, 286 transitions, 3632 flow. Second operand 15 states and 127 transitions. [2025-04-13 20:30:06,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 318 transitions, 4582 flow [2025-04-13 20:30:06,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 318 transitions, 4308 flow, removed 104 selfloop flow, removed 9 redundant places. [2025-04-13 20:30:06,444 INFO L231 Difference]: Finished difference. Result has 210 places, 292 transitions, 3732 flow [2025-04-13 20:30:06,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3358, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3732, PETRI_PLACES=210, PETRI_TRANSITIONS=292} [2025-04-13 20:30:06,445 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2025-04-13 20:30:06,445 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 292 transitions, 3732 flow [2025-04-13 20:30:06,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.111111111111111) internal successors, (138), 27 states have internal predecessors, (138), 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-04-13 20:30:06,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:06,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:06,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 20:30:06,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 20:30:06,646 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:06,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:06,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1684860340, now seen corresponding path program 22 times [2025-04-13 20:30:06,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:06,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383062651] [2025-04-13 20:30:06,647 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:30:06,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:06,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:30:06,661 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:30:06,661 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:30:06,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:30:08,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:08,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383062651] [2025-04-13 20:30:08,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383062651] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:08,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873875682] [2025-04-13 20:30:08,555 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:30:08,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:08,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:08,558 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:30:08,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 20:30:08,623 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:30:08,647 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:30:08,647 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:30:08,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:08,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 20:30:08,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:08,803 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:30:09,009 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:30:09,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:30:10,498 INFO L325 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-04-13 20:30:10,498 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:30:10,720 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-04-13 20:30:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:30:10,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:15,185 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse1 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 ~B~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)))) (= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~B~0.base) (+ ~B~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4)))) (+ .cse1 c_~csum~0 .cse2))))) is different from false [2025-04-13 20:30:15,632 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:30:15,633 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 134 [2025-04-13 20:30:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2025-04-13 20:30:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873875682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:18,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:18,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2025-04-13 20:30:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555542833] [2025-04-13 20:30:18,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:18,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 20:30:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:18,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 20:30:18,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=674, Unknown=1, NotChecked=54, Total=870 [2025-04-13 20:30:18,830 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:30:18,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 292 transitions, 3732 flow. Second operand has 30 states, 30 states have (on average 5.266666666666667) internal successors, (158), 30 states have internal predecessors, (158), 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-04-13 20:30:18,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:18,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:30:18,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:25,747 INFO L116 PetriNetUnfolderBase]: 2724/3944 cut-off events. [2025-04-13 20:30:25,747 INFO L117 PetriNetUnfolderBase]: For 57793/57793 co-relation queries the response was YES. [2025-04-13 20:30:25,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22514 conditions, 3944 events. 2724/3944 cut-off events. For 57793/57793 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 18508 event pairs, 833 based on Foata normal form. 1/3945 useless extension candidates. Maximal degree in co-relation 22386. Up to 3783 conditions per place. [2025-04-13 20:30:25,818 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 271 selfloop transitions, 57 changer transitions 1/329 dead transitions. [2025-04-13 20:30:25,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 329 transitions, 4769 flow [2025-04-13 20:30:25,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:30:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:30:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 123 transitions. [2025-04-13 20:30:25,819 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2025-04-13 20:30:25,819 INFO L175 Difference]: Start difference. First operand has 210 places, 292 transitions, 3732 flow. Second operand 13 states and 123 transitions. [2025-04-13 20:30:25,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 329 transitions, 4769 flow [2025-04-13 20:30:25,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 329 transitions, 4483 flow, removed 110 selfloop flow, removed 11 redundant places. [2025-04-13 20:30:25,950 INFO L231 Difference]: Finished difference. Result has 214 places, 301 transitions, 3889 flow [2025-04-13 20:30:25,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3446, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3889, PETRI_PLACES=214, PETRI_TRANSITIONS=301} [2025-04-13 20:30:25,951 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2025-04-13 20:30:25,951 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 301 transitions, 3889 flow [2025-04-13 20:30:25,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.266666666666667) internal successors, (158), 30 states have internal predecessors, (158), 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-04-13 20:30:25,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:25,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:25,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 20:30:26,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 20:30:26,152 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:26,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2080653652, now seen corresponding path program 23 times [2025-04-13 20:30:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:26,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671894041] [2025-04-13 20:30:26,153 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:30:26,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:26,160 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:30:26,167 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:30:26,167 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:30:26,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:30:27,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:27,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671894041] [2025-04-13 20:30:27,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671894041] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:27,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809635650] [2025-04-13 20:30:27,479 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:30:27,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:27,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:27,481 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:30:27,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 20:30:27,548 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:30:27,573 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:30:27,573 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:30:27,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:27,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 20:30:27,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:31,059 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:30:31,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:30:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:30:31,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:31,856 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:30:31,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-13 20:30:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:30:33,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809635650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:33,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:33,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 21 [2025-04-13 20:30:33,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463201052] [2025-04-13 20:30:33,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:33,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:30:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:33,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:30:33,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:30:33,764 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:30:33,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 301 transitions, 3889 flow. Second operand has 23 states, 23 states have (on average 5.869565217391305) internal successors, (135), 23 states have internal predecessors, (135), 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-04-13 20:30:33,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:33,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:30:33,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:38,112 INFO L116 PetriNetUnfolderBase]: 2799/4053 cut-off events. [2025-04-13 20:30:38,112 INFO L117 PetriNetUnfolderBase]: For 60195/60195 co-relation queries the response was YES. [2025-04-13 20:30:38,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23088 conditions, 4053 events. 2799/4053 cut-off events. For 60195/60195 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 19179 event pairs, 869 based on Foata normal form. 1/4054 useless extension candidates. Maximal degree in co-relation 22956. Up to 3890 conditions per place. [2025-04-13 20:30:38,137 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 283 selfloop transitions, 52 changer transitions 1/336 dead transitions. [2025-04-13 20:30:38,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 336 transitions, 4817 flow [2025-04-13 20:30:38,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:30:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:30:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-04-13 20:30:38,138 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2025-04-13 20:30:38,138 INFO L175 Difference]: Start difference. First operand has 214 places, 301 transitions, 3889 flow. Second operand 10 states and 112 transitions. [2025-04-13 20:30:38,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 336 transitions, 4817 flow [2025-04-13 20:30:38,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 336 transitions, 4527 flow, removed 114 selfloop flow, removed 8 redundant places. [2025-04-13 20:30:38,257 INFO L231 Difference]: Finished difference. Result has 217 places, 307 transitions, 3900 flow [2025-04-13 20:30:38,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3599, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3900, PETRI_PLACES=217, PETRI_TRANSITIONS=307} [2025-04-13 20:30:38,257 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2025-04-13 20:30:38,257 INFO L485 AbstractCegarLoop]: Abstraction has has 217 places, 307 transitions, 3900 flow [2025-04-13 20:30:38,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.869565217391305) internal successors, (135), 23 states have internal predecessors, (135), 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-04-13 20:30:38,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:38,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:38,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 20:30:38,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:38,458 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:38,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:38,459 INFO L85 PathProgramCache]: Analyzing trace with hash 376779506, now seen corresponding path program 24 times [2025-04-13 20:30:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:38,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669071829] [2025-04-13 20:30:38,459 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:30:38,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:38,464 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:30:38,475 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:30:38,475 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:30:38,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:30:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:41,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669071829] [2025-04-13 20:30:41,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669071829] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:41,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736695455] [2025-04-13 20:30:41,209 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:30:41,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:41,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:41,210 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:30:41,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 20:30:41,278 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:30:41,299 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:30:41,300 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:30:41,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:41,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 20:30:41,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:41,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:30:41,561 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-13 20:30:41,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-13 20:30:41,923 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-13 20:30:41,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 20:30:43,017 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:30:43,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-13 20:30:44,451 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:30:44,451 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2025-04-13 20:30:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:30:44,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:45,499 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:30:45,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 199 [2025-04-13 20:30:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:30:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736695455] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:50,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-04-13 20:30:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945925171] [2025-04-13 20:30:50,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:50,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:30:50,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:50,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:30:50,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:30:50,787 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:30:50,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 307 transitions, 3900 flow. Second operand has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 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-04-13 20:30:50,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:50,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:30:50,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:57,415 INFO L116 PetriNetUnfolderBase]: 2903/4202 cut-off events. [2025-04-13 20:30:57,415 INFO L117 PetriNetUnfolderBase]: For 67154/67154 co-relation queries the response was YES. [2025-04-13 20:30:57,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24181 conditions, 4202 events. 2903/4202 cut-off events. For 67154/67154 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 19984 event pairs, 884 based on Foata normal form. 1/4203 useless extension candidates. Maximal degree in co-relation 24051. Up to 4021 conditions per place. [2025-04-13 20:30:57,447 INFO L140 encePairwiseOnDemand]: 17/30 looper letters, 282 selfloop transitions, 63 changer transitions 1/346 dead transitions. [2025-04-13 20:30:57,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 346 transitions, 5104 flow [2025-04-13 20:30:57,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:30:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:30:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 124 transitions. [2025-04-13 20:30:57,448 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29523809523809524 [2025-04-13 20:30:57,448 INFO L175 Difference]: Start difference. First operand has 217 places, 307 transitions, 3900 flow. Second operand 14 states and 124 transitions. [2025-04-13 20:30:57,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 346 transitions, 5104 flow [2025-04-13 20:30:57,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 346 transitions, 4864 flow, removed 72 selfloop flow, removed 7 redundant places. [2025-04-13 20:30:57,629 INFO L231 Difference]: Finished difference. Result has 225 places, 320 transitions, 4253 flow [2025-04-13 20:30:57,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3660, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4253, PETRI_PLACES=225, PETRI_TRANSITIONS=320} [2025-04-13 20:30:57,630 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2025-04-13 20:30:57,630 INFO L485 AbstractCegarLoop]: Abstraction has has 225 places, 320 transitions, 4253 flow [2025-04-13 20:30:57,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 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-04-13 20:30:57,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:57,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:57,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 20:30:57,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:57,831 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:57,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1571400848, now seen corresponding path program 25 times [2025-04-13 20:30:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:57,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065170161] [2025-04-13 20:30:57,832 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:30:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:57,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:30:57,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:30:57,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:57,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:01,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:01,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065170161] [2025-04-13 20:31:01,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065170161] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:01,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442543083] [2025-04-13 20:31:01,144 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:01,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:01,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:01,146 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:01,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 20:31:01,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:31:01,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:31:01,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:01,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:01,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 20:31:01,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:01,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:31:01,662 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-13 20:31:01,662 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-13 20:31:02,135 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-13 20:31:02,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 20:31:03,926 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 20:31:03,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-13 20:31:05,166 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:05,166 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2025-04-13 20:31:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:31:05,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:06,361 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:06,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 199 [2025-04-13 20:31:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:31:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442543083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:10,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-04-13 20:31:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319170391] [2025-04-13 20:31:10,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:10,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:31:10,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:10,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:31:10,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:31:10,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:31:10,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 320 transitions, 4253 flow. Second operand has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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-04-13 20:31:10,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:10,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:31:10,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:20,194 INFO L116 PetriNetUnfolderBase]: 3025/4377 cut-off events. [2025-04-13 20:31:20,194 INFO L117 PetriNetUnfolderBase]: For 80860/80860 co-relation queries the response was YES. [2025-04-13 20:31:20,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25846 conditions, 4377 events. 3025/4377 cut-off events. For 80860/80860 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 20973 event pairs, 893 based on Foata normal form. 1/4378 useless extension candidates. Maximal degree in co-relation 25710. Up to 4114 conditions per place. [2025-04-13 20:31:20,229 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 284 selfloop transitions, 73 changer transitions 1/358 dead transitions. [2025-04-13 20:31:20,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 358 transitions, 5468 flow [2025-04-13 20:31:20,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:31:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:31:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2025-04-13 20:31:20,230 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2911111111111111 [2025-04-13 20:31:20,230 INFO L175 Difference]: Start difference. First operand has 225 places, 320 transitions, 4253 flow. Second operand 15 states and 131 transitions. [2025-04-13 20:31:20,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 358 transitions, 5468 flow [2025-04-13 20:31:20,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 358 transitions, 5018 flow, removed 195 selfloop flow, removed 8 redundant places. [2025-04-13 20:31:20,486 INFO L231 Difference]: Finished difference. Result has 233 places, 330 transitions, 4396 flow [2025-04-13 20:31:20,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3803, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4396, PETRI_PLACES=233, PETRI_TRANSITIONS=330} [2025-04-13 20:31:20,487 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2025-04-13 20:31:20,487 INFO L485 AbstractCegarLoop]: Abstraction has has 233 places, 330 transitions, 4396 flow [2025-04-13 20:31:20,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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-04-13 20:31:20,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:20,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:20,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:20,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:20,688 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:20,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash -102558734, now seen corresponding path program 26 times [2025-04-13 20:31:20,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:20,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960336662] [2025-04-13 20:31:20,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:31:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:20,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:31:20,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:31:20,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:20,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:23,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:23,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960336662] [2025-04-13 20:31:23,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960336662] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:23,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381877933] [2025-04-13 20:31:23,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:31:23,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:23,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:23,446 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:23,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 20:31:23,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:31:23,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:31:23,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:23,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:23,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 20:31:23,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:23,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:31:24,299 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:31:24,299 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:31:25,655 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-13 20:31:25,656 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:31:27,032 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:27,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 94 [2025-04-13 20:31:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:31:27,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:30,966 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:30,966 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 118 [2025-04-13 20:31:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:31:33,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381877933] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:33,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:33,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 23 [2025-04-13 20:31:33,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832142086] [2025-04-13 20:31:33,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:33,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:31:33,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:33,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:31:33,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:31:33,540 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:31:33,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 330 transitions, 4396 flow. Second operand has 25 states, 25 states have (on average 5.16) internal successors, (129), 25 states have internal predecessors, (129), 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-04-13 20:31:33,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:33,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:31:33,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:40,736 INFO L116 PetriNetUnfolderBase]: 3147/4552 cut-off events. [2025-04-13 20:31:40,736 INFO L117 PetriNetUnfolderBase]: For 90100/90100 co-relation queries the response was YES. [2025-04-13 20:31:40,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27263 conditions, 4552 events. 3147/4552 cut-off events. For 90100/90100 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 22082 event pairs, 935 based on Foata normal form. 1/4553 useless extension candidates. Maximal degree in co-relation 27123. Up to 4285 conditions per place. [2025-04-13 20:31:40,772 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 293 selfloop transitions, 75 changer transitions 1/369 dead transitions. [2025-04-13 20:31:40,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 369 transitions, 5656 flow [2025-04-13 20:31:40,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:31:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:31:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 126 transitions. [2025-04-13 20:31:40,773 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3230769230769231 [2025-04-13 20:31:40,773 INFO L175 Difference]: Start difference. First operand has 233 places, 330 transitions, 4396 flow. Second operand 13 states and 126 transitions. [2025-04-13 20:31:40,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 369 transitions, 5656 flow [2025-04-13 20:31:40,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 369 transitions, 5211 flow, removed 185 selfloop flow, removed 10 redundant places. [2025-04-13 20:31:40,990 INFO L231 Difference]: Finished difference. Result has 237 places, 340 transitions, 4567 flow [2025-04-13 20:31:40,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3951, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4567, PETRI_PLACES=237, PETRI_TRANSITIONS=340} [2025-04-13 20:31:40,990 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 207 predicate places. [2025-04-13 20:31:40,990 INFO L485 AbstractCegarLoop]: Abstraction has has 237 places, 340 transitions, 4567 flow [2025-04-13 20:31:40,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.16) internal successors, (129), 25 states have internal predecessors, (129), 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-04-13 20:31:40,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:40,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:40,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:41,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:41,191 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:41,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash -490758042, now seen corresponding path program 27 times [2025-04-13 20:31:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:41,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368984985] [2025-04-13 20:31:41,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:41,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:31:41,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:31:41,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:31:41,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:44,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:44,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368984985] [2025-04-13 20:31:44,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368984985] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:44,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231312606] [2025-04-13 20:31:44,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:44,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:44,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:44,900 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:44,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 20:31:44,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:31:44,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:31:44,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:31:44,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:44,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 20:31:45,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:45,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:31:45,350 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-13 20:31:45,351 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-13 20:31:45,697 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-13 20:31:45,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 20:31:46,982 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:31:46,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-13 20:31:48,682 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:48,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2025-04-13 20:31:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:31:48,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:49,812 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:49,812 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 199 [2025-04-13 20:31:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:31:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231312606] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:55,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:55,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2025-04-13 20:31:55,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457512407] [2025-04-13 20:31:55,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:55,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:31:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:55,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:31:55,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:31:55,869 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:31:55,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 340 transitions, 4567 flow. Second operand has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 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-04-13 20:31:55,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:55,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:31:55,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:03,707 INFO L116 PetriNetUnfolderBase]: 3217/4653 cut-off events. [2025-04-13 20:32:03,707 INFO L117 PetriNetUnfolderBase]: For 90540/90540 co-relation queries the response was YES. [2025-04-13 20:32:03,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27591 conditions, 4653 events. 3217/4653 cut-off events. For 90540/90540 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 22615 event pairs, 990 based on Foata normal form. 1/4654 useless extension candidates. Maximal degree in co-relation 27448. Up to 4477 conditions per place. [2025-04-13 20:32:03,743 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 306 selfloop transitions, 64 changer transitions 1/371 dead transitions. [2025-04-13 20:32:03,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 371 transitions, 5684 flow [2025-04-13 20:32:03,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:32:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:32:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2025-04-13 20:32:03,744 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2822222222222222 [2025-04-13 20:32:03,744 INFO L175 Difference]: Start difference. First operand has 237 places, 340 transitions, 4567 flow. Second operand 15 states and 127 transitions. [2025-04-13 20:32:03,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 371 transitions, 5684 flow [2025-04-13 20:32:03,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 371 transitions, 5206 flow, removed 199 selfloop flow, removed 8 redundant places. [2025-04-13 20:32:03,903 INFO L231 Difference]: Finished difference. Result has 245 places, 346 transitions, 4539 flow [2025-04-13 20:32:03,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4089, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4539, PETRI_PLACES=245, PETRI_TRANSITIONS=346} [2025-04-13 20:32:03,904 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2025-04-13 20:32:03,904 INFO L485 AbstractCegarLoop]: Abstraction has has 245 places, 346 transitions, 4539 flow [2025-04-13 20:32:03,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 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-04-13 20:32:03,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:03,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:03,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 20:32:04,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-13 20:32:04,105 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:04,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:04,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1141670600, now seen corresponding path program 28 times [2025-04-13 20:32:04,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:04,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052773072] [2025-04-13 20:32:04,105 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:32:04,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:04,112 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:32:04,123 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:32:04,123 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:32:04,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:07,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052773072] [2025-04-13 20:32:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052773072] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:07,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718649233] [2025-04-13 20:32:07,845 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:32:07,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:07,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:07,848 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:32:07,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 20:32:07,929 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:32:07,950 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:32:07,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:32:07,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:07,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 20:32:07,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:07,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:32:08,455 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-13 20:32:08,455 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-13 20:32:09,028 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-13 20:32:09,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 20:32:11,567 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2025-04-13 20:32:12,631 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-04-13 20:32:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:32:12,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:13,764 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:32:13,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 215 [2025-04-13 20:32:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:32:18,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718649233] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:32:18,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:32:18,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-04-13 20:32:18,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109242745] [2025-04-13 20:32:18,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:32:18,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:32:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:18,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:32:18,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:32:18,773 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:32:18,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 346 transitions, 4539 flow. Second operand has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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-04-13 20:32:18,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:18,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:32:18,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:26,811 INFO L116 PetriNetUnfolderBase]: 3297/4768 cut-off events. [2025-04-13 20:32:26,811 INFO L117 PetriNetUnfolderBase]: For 90721/90721 co-relation queries the response was YES. [2025-04-13 20:32:26,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27750 conditions, 4768 events. 3297/4768 cut-off events. For 90721/90721 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 23280 event pairs, 1035 based on Foata normal form. 1/4769 useless extension candidates. Maximal degree in co-relation 27604. Up to 4614 conditions per place. [2025-04-13 20:32:26,848 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 320 selfloop transitions, 58 changer transitions 1/379 dead transitions. [2025-04-13 20:32:26,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 379 transitions, 5715 flow [2025-04-13 20:32:26,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:32:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:32:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 125 transitions. [2025-04-13 20:32:26,849 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2025-04-13 20:32:26,850 INFO L175 Difference]: Start difference. First operand has 245 places, 346 transitions, 4539 flow. Second operand 15 states and 125 transitions. [2025-04-13 20:32:26,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 379 transitions, 5715 flow [2025-04-13 20:32:27,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 379 transitions, 5353 flow, removed 141 selfloop flow, removed 11 redundant places. [2025-04-13 20:32:27,022 INFO L231 Difference]: Finished difference. Result has 251 places, 355 transitions, 4672 flow [2025-04-13 20:32:27,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4180, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4672, PETRI_PLACES=251, PETRI_TRANSITIONS=355} [2025-04-13 20:32:27,023 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places. [2025-04-13 20:32:27,023 INFO L485 AbstractCegarLoop]: Abstraction has has 251 places, 355 transitions, 4672 flow [2025-04-13 20:32:27,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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-04-13 20:32:27,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:27,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:27,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 20:32:27,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:27,224 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:27,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:27,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1919972326, now seen corresponding path program 29 times [2025-04-13 20:32:27,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:27,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328022053] [2025-04-13 20:32:27,224 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:32:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:27,231 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:32:27,239 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:32:27,240 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:32:27,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:30,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:30,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328022053] [2025-04-13 20:32:30,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328022053] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:30,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637607928] [2025-04-13 20:32:30,233 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:32:30,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:30,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:30,235 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:32:30,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 20:32:30,335 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:32:30,358 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:32:30,359 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:32:30,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:30,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 20:32:30,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:30,393 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:32:30,941 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-13 20:32:30,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-13 20:32:31,426 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:32:31,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:32:34,848 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-13 20:32:34,848 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:32:35,832 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:32:35,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 94 [2025-04-13 20:32:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:32:36,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:37,344 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:32:37,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 134 [2025-04-13 20:32:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:32:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637607928] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:32:40,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:32:40,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-04-13 20:32:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053845373] [2025-04-13 20:32:40,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:32:40,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:32:40,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:40,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:32:40,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:32:40,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:32:40,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 355 transitions, 4672 flow. Second operand has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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-04-13 20:32:40,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:40,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:32:40,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:49,469 INFO L116 PetriNetUnfolderBase]: 3367/4869 cut-off events. [2025-04-13 20:32:49,469 INFO L117 PetriNetUnfolderBase]: For 96291/96291 co-relation queries the response was YES. [2025-04-13 20:32:49,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28468 conditions, 4869 events. 3367/4869 cut-off events. For 96291/96291 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 23910 event pairs, 1070 based on Foata normal form. 1/4870 useless extension candidates. Maximal degree in co-relation 28318. Up to 4715 conditions per place. [2025-04-13 20:32:49,511 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 326 selfloop transitions, 58 changer transitions 1/385 dead transitions. [2025-04-13 20:32:49,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 385 transitions, 5837 flow [2025-04-13 20:32:49,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:32:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:32:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2025-04-13 20:32:49,512 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30512820512820515 [2025-04-13 20:32:49,513 INFO L175 Difference]: Start difference. First operand has 251 places, 355 transitions, 4672 flow. Second operand 13 states and 119 transitions. [2025-04-13 20:32:49,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 385 transitions, 5837 flow [2025-04-13 20:32:49,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 385 transitions, 5471 flow, removed 151 selfloop flow, removed 10 redundant places. [2025-04-13 20:32:49,788 INFO L231 Difference]: Finished difference. Result has 255 places, 361 transitions, 4768 flow [2025-04-13 20:32:49,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4306, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4768, PETRI_PLACES=255, PETRI_TRANSITIONS=361} [2025-04-13 20:32:49,789 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2025-04-13 20:32:49,789 INFO L485 AbstractCegarLoop]: Abstraction has has 255 places, 361 transitions, 4768 flow [2025-04-13 20:32:49,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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-04-13 20:32:49,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:49,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:49,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 20:32:49,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:49,990 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:49,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash -143632952, now seen corresponding path program 30 times [2025-04-13 20:32:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:49,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308184622] [2025-04-13 20:32:49,990 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:32:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:49,996 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:32:50,005 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:32:50,005 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:32:50,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:32:53,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:53,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308184622] [2025-04-13 20:32:53,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308184622] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:53,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435569151] [2025-04-13 20:32:53,720 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:32:53,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:53,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:53,722 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:32:53,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 20:32:53,801 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:32:53,822 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:32:53,823 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:32:53,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:53,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 20:32:53,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:54,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:32:54,612 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:32:54,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:32:56,601 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-13 20:32:56,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:32:57,734 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:32:57,735 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 96 [2025-04-13 20:32:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:32:58,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:00,838 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:00,839 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 134 [2025-04-13 20:33:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:33:03,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435569151] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:33:03,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:33:03,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 25 [2025-04-13 20:33:03,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965178756] [2025-04-13 20:33:03,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:33:03,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:33:03,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:03,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:33:03,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:33:03,211 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:33:03,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 361 transitions, 4768 flow. Second operand has 27 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 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-04-13 20:33:03,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:03,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:33:03,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:11,139 INFO L116 PetriNetUnfolderBase]: 3441/4976 cut-off events. [2025-04-13 20:33:11,139 INFO L117 PetriNetUnfolderBase]: For 97626/97626 co-relation queries the response was YES. [2025-04-13 20:33:11,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28916 conditions, 4976 events. 3441/4976 cut-off events. For 97626/97626 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 24547 event pairs, 1078 based on Foata normal form. 1/4977 useless extension candidates. Maximal degree in co-relation 28763. Up to 4815 conditions per place. [2025-04-13 20:33:11,181 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 334 selfloop transitions, 58 changer transitions 1/393 dead transitions. [2025-04-13 20:33:11,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 393 transitions, 5844 flow [2025-04-13 20:33:11,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:33:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:33:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2025-04-13 20:33:11,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2822222222222222 [2025-04-13 20:33:11,182 INFO L175 Difference]: Start difference. First operand has 255 places, 361 transitions, 4768 flow. Second operand 15 states and 127 transitions. [2025-04-13 20:33:11,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 393 transitions, 5844 flow [2025-04-13 20:33:11,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 393 transitions, 5470 flow, removed 153 selfloop flow, removed 9 redundant places. [2025-04-13 20:33:11,366 INFO L231 Difference]: Finished difference. Result has 262 places, 367 transitions, 4749 flow [2025-04-13 20:33:11,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4394, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4749, PETRI_PLACES=262, PETRI_TRANSITIONS=367} [2025-04-13 20:33:11,367 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 232 predicate places. [2025-04-13 20:33:11,367 INFO L485 AbstractCegarLoop]: Abstraction has has 262 places, 367 transitions, 4749 flow [2025-04-13 20:33:11,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 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-04-13 20:33:11,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:11,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:11,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 20:33:11,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 20:33:11,568 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:11,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:11,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1765077014, now seen corresponding path program 31 times [2025-04-13 20:33:11,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:11,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780037729] [2025-04-13 20:33:11,569 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:11,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:11,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:33:11,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:33:11,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:11,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:14,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:14,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780037729] [2025-04-13 20:33:14,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780037729] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:14,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79221339] [2025-04-13 20:33:14,497 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:14,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:14,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:14,499 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:33:14,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 20:33:14,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:33:14,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:33:14,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:14,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:14,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 20:33:14,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:14,835 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:33:15,223 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:33:15,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:33:17,516 INFO L325 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-04-13 20:33:17,517 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:33:17,940 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-04-13 20:33:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:33:17,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:22,304 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse1 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 ~B~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)))) (= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~B~0.base) (+ ~B~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4)))) (+ .cse1 c_~csum~0 .cse2))))) is different from false [2025-04-13 20:33:26,644 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse1 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 ~B~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)))) (= (+ (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~B~0.base) ~B~0.offset) c_~asum~0 c_~bsum~0) (+ .cse1 c_~csum~0 .cse2))))) is different from false [2025-04-13 20:33:27,131 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:27,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 118 [2025-04-13 20:33:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-04-13 20:33:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79221339] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:33:29,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:33:29,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2025-04-13 20:33:29,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736233621] [2025-04-13 20:33:29,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:33:29,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 20:33:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:29,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 20:33:29,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=631, Unknown=2, NotChecked=106, Total=870 [2025-04-13 20:33:29,436 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:33:29,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 367 transitions, 4749 flow. Second operand has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 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-04-13 20:33:29,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:29,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:33:29,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:37,559 INFO L116 PetriNetUnfolderBase]: 3515/5083 cut-off events. [2025-04-13 20:33:37,560 INFO L117 PetriNetUnfolderBase]: For 99710/99710 co-relation queries the response was YES. [2025-04-13 20:33:37,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29385 conditions, 5083 events. 3515/5083 cut-off events. For 99710/99710 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 25191 event pairs, 1086 based on Foata normal form. 1/5084 useless extension candidates. Maximal degree in co-relation 29229. Up to 4891 conditions per place. [2025-04-13 20:33:37,597 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 331 selfloop transitions, 69 changer transitions 1/401 dead transitions. [2025-04-13 20:33:37,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 401 transitions, 5860 flow [2025-04-13 20:33:37,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:33:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:33:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 124 transitions. [2025-04-13 20:33:37,598 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31794871794871793 [2025-04-13 20:33:37,598 INFO L175 Difference]: Start difference. First operand has 262 places, 367 transitions, 4749 flow. Second operand 13 states and 124 transitions. [2025-04-13 20:33:37,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 401 transitions, 5860 flow [2025-04-13 20:33:37,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 401 transitions, 5560 flow, removed 96 selfloop flow, removed 12 redundant places. [2025-04-13 20:33:37,785 INFO L231 Difference]: Finished difference. Result has 264 places, 373 transitions, 4838 flow [2025-04-13 20:33:37,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4449, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4838, PETRI_PLACES=264, PETRI_TRANSITIONS=373} [2025-04-13 20:33:37,786 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 234 predicate places. [2025-04-13 20:33:37,786 INFO L485 AbstractCegarLoop]: Abstraction has has 264 places, 373 transitions, 4838 flow [2025-04-13 20:33:37,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 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-04-13 20:33:37,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:37,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:37,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 20:33:37,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 20:33:37,986 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:37,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:37,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2142205286, now seen corresponding path program 32 times [2025-04-13 20:33:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:37,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91859108] [2025-04-13 20:33:37,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:37,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:33:38,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:33:38,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:38,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:42,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91859108] [2025-04-13 20:33:42,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91859108] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:42,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121057921] [2025-04-13 20:33:42,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:42,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:42,327 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:33:42,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 20:33:42,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:33:42,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:33:42,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:42,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:42,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 20:33:42,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:42,455 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:33:42,777 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-13 20:33:42,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-13 20:33:43,220 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-13 20:33:43,221 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 20:33:44,988 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:33:44,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-13 20:33:46,478 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:46,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2025-04-13 20:33:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:33:46,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:47,577 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:47,578 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 215 [2025-04-13 20:33:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:33:54,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121057921] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:33:54,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:33:54,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 23 [2025-04-13 20:33:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071893700] [2025-04-13 20:33:54,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:33:54,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:33:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:54,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:33:54,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:33:54,117 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:33:54,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 373 transitions, 4838 flow. Second operand has 25 states, 25 states have (on average 5.32) internal successors, (133), 25 states have internal predecessors, (133), 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-04-13 20:33:54,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:54,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:33:54,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:01,913 INFO L116 PetriNetUnfolderBase]: 3589/5190 cut-off events. [2025-04-13 20:34:01,913 INFO L117 PetriNetUnfolderBase]: For 105567/105567 co-relation queries the response was YES. [2025-04-13 20:34:01,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30030 conditions, 5190 events. 3589/5190 cut-off events. For 105567/105567 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 25834 event pairs, 1138 based on Foata normal form. 1/5191 useless extension candidates. Maximal degree in co-relation 29873. Up to 5031 conditions per place. [2025-04-13 20:34:01,951 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 345 selfloop transitions, 58 changer transitions 1/404 dead transitions. [2025-04-13 20:34:01,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 404 transitions, 5951 flow [2025-04-13 20:34:01,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:34:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:34:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2025-04-13 20:34:01,952 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28 [2025-04-13 20:34:01,952 INFO L175 Difference]: Start difference. First operand has 264 places, 373 transitions, 4838 flow. Second operand 15 states and 126 transitions. [2025-04-13 20:34:01,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 404 transitions, 5951 flow [2025-04-13 20:34:02,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 404 transitions, 5623 flow, removed 99 selfloop flow, removed 10 redundant places. [2025-04-13 20:34:02,166 INFO L231 Difference]: Finished difference. Result has 270 places, 379 transitions, 4883 flow [2025-04-13 20:34:02,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4510, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4883, PETRI_PLACES=270, PETRI_TRANSITIONS=379} [2025-04-13 20:34:02,166 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 240 predicate places. [2025-04-13 20:34:02,167 INFO L485 AbstractCegarLoop]: Abstraction has has 270 places, 379 transitions, 4883 flow [2025-04-13 20:34:02,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.32) internal successors, (133), 25 states have internal predecessors, (133), 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-04-13 20:34:02,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:02,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:02,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 20:34:02,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 20:34:02,367 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:02,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1405795784, now seen corresponding path program 33 times [2025-04-13 20:34:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:02,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160977408] [2025-04-13 20:34:02,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:34:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:02,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:34:02,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:34:02,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:34:02,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:34:06,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:06,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160977408] [2025-04-13 20:34:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160977408] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:06,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188295565] [2025-04-13 20:34:06,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:34:06,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:06,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:06,199 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:34:06,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 20:34:06,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:34:06,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:34:06,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:34:06,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:06,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:34:06,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:34:09,114 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:34:09,114 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:34:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:34:09,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:34:10,214 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:34:10,215 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-13 20:34:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:34:11,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188295565] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:34:11,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:34:11,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 20 [2025-04-13 20:34:11,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764838962] [2025-04-13 20:34:11,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:34:11,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:34:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:11,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:34:11,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:34:11,710 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:34:11,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 379 transitions, 4883 flow. Second operand has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 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-04-13 20:34:11,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:11,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:34:11,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:20,984 INFO L116 PetriNetUnfolderBase]: 3664/5299 cut-off events. [2025-04-13 20:34:20,985 INFO L117 PetriNetUnfolderBase]: For 111610/111610 co-relation queries the response was YES. [2025-04-13 20:34:21,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30593 conditions, 5299 events. 3664/5299 cut-off events. For 111610/111610 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 26487 event pairs, 1189 based on Foata normal form. 1/5300 useless extension candidates. Maximal degree in co-relation 30434. Up to 5136 conditions per place. [2025-04-13 20:34:21,031 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 353 selfloop transitions, 58 changer transitions 1/412 dead transitions. [2025-04-13 20:34:21,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 412 transitions, 6024 flow [2025-04-13 20:34:21,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:34:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:34:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 128 transitions. [2025-04-13 20:34:21,032 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28444444444444444 [2025-04-13 20:34:21,032 INFO L175 Difference]: Start difference. First operand has 270 places, 379 transitions, 4883 flow. Second operand 15 states and 128 transitions. [2025-04-13 20:34:21,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 412 transitions, 6024 flow [2025-04-13 20:34:21,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 412 transitions, 5712 flow, removed 102 selfloop flow, removed 12 redundant places. [2025-04-13 20:34:21,259 INFO L231 Difference]: Finished difference. Result has 274 places, 385 transitions, 4950 flow [2025-04-13 20:34:21,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4571, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4950, PETRI_PLACES=274, PETRI_TRANSITIONS=385} [2025-04-13 20:34:21,260 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 244 predicate places. [2025-04-13 20:34:21,260 INFO L485 AbstractCegarLoop]: Abstraction has has 274 places, 385 transitions, 4950 flow [2025-04-13 20:34:21,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 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-04-13 20:34:21,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:21,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:21,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 20:34:21,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 20:34:21,461 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:21,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 409713318, now seen corresponding path program 34 times [2025-04-13 20:34:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:21,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736851585] [2025-04-13 20:34:21,461 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:34:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:21,467 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:34:21,474 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:34:21,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:34:21,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:24,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736851585] [2025-04-13 20:34:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736851585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:24,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293275697] [2025-04-13 20:34:24,497 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:34:24,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:24,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:24,499 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:34:24,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 20:34:24,588 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:34:24,613 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:34:24,613 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:34:24,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:24,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:34:24,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:34:27,081 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:34:27,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-04-13 20:34:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:34:27,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:34:44,357 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:34:44,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-04-13 20:34:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:34:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293275697] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:34:44,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:34:44,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 22 [2025-04-13 20:34:44,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744747693] [2025-04-13 20:34:44,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:34:44,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:34:44,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:44,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:34:44,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=461, Unknown=4, NotChecked=0, Total=552 [2025-04-13 20:34:44,902 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:34:44,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 385 transitions, 4950 flow. Second operand has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 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-04-13 20:34:44,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:44,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:34:44,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:55,688 INFO L116 PetriNetUnfolderBase]: 3889/5624 cut-off events. [2025-04-13 20:34:55,688 INFO L117 PetriNetUnfolderBase]: For 145718/145718 co-relation queries the response was YES. [2025-04-13 20:34:55,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34165 conditions, 5624 events. 3889/5624 cut-off events. For 145718/145718 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 28457 event pairs, 1036 based on Foata normal form. 1/5625 useless extension candidates. Maximal degree in co-relation 34004. Up to 5278 conditions per place. [2025-04-13 20:34:55,745 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 366 selfloop transitions, 72 changer transitions 1/439 dead transitions. [2025-04-13 20:34:55,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 439 transitions, 6751 flow [2025-04-13 20:34:55,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:34:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:34:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2025-04-13 20:34:55,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34102564102564104 [2025-04-13 20:34:55,746 INFO L175 Difference]: Start difference. First operand has 274 places, 385 transitions, 4950 flow. Second operand 13 states and 133 transitions. [2025-04-13 20:34:55,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 439 transitions, 6751 flow [2025-04-13 20:34:56,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 439 transitions, 6433 flow, removed 105 selfloop flow, removed 12 redundant places. [2025-04-13 20:34:56,238 INFO L231 Difference]: Finished difference. Result has 277 places, 402 transitions, 5602 flow [2025-04-13 20:34:56,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4632, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5602, PETRI_PLACES=277, PETRI_TRANSITIONS=402} [2025-04-13 20:34:56,239 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 247 predicate places. [2025-04-13 20:34:56,239 INFO L485 AbstractCegarLoop]: Abstraction has has 277 places, 402 transitions, 5602 flow [2025-04-13 20:34:56,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 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-04-13 20:34:56,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:56,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:56,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 20:34:56,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:56,440 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:56,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1015193650, now seen corresponding path program 35 times [2025-04-13 20:34:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:56,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336905322] [2025-04-13 20:34:56,440 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:34:56,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:56,446 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:34:56,452 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:34:56,452 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:34:56,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:34:58,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:58,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336905322] [2025-04-13 20:34:58,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336905322] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:58,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077251984] [2025-04-13 20:34:58,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:34:58,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:58,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:58,583 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:34:58,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 20:34:58,667 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:34:58,689 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:34:58,690 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:34:58,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:58,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:34:58,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:02,791 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:35:02,791 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:35:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:35:02,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:03,951 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:35:03,951 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-04-13 20:35:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:35:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077251984] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:35:04,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:35:04,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 23 [2025-04-13 20:35:04,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385826321] [2025-04-13 20:35:04,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:35:04,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:35:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:04,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:35:04,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:35:04,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:35:04,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 402 transitions, 5602 flow. Second operand has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 states have internal predecessors, (140), 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-04-13 20:35:04,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:04,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:35:04,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:13,796 INFO L116 PetriNetUnfolderBase]: 4004/5789 cut-off events. [2025-04-13 20:35:13,796 INFO L117 PetriNetUnfolderBase]: For 160491/160491 co-relation queries the response was YES. [2025-04-13 20:35:13,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36147 conditions, 5789 events. 4004/5789 cut-off events. For 160491/160491 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 29332 event pairs, 1071 based on Foata normal form. 1/5790 useless extension candidates. Maximal degree in co-relation 35983. Up to 5490 conditions per place. [2025-04-13 20:35:13,851 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 367 selfloop transitions, 79 changer transitions 1/447 dead transitions. [2025-04-13 20:35:13,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 447 transitions, 7342 flow [2025-04-13 20:35:13,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:35:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:35:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2025-04-13 20:35:13,852 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32051282051282054 [2025-04-13 20:35:13,853 INFO L175 Difference]: Start difference. First operand has 277 places, 402 transitions, 5602 flow. Second operand 13 states and 125 transitions. [2025-04-13 20:35:13,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 447 transitions, 7342 flow [2025-04-13 20:35:14,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 447 transitions, 6150 flow, removed 570 selfloop flow, removed 6 redundant places. [2025-04-13 20:35:14,460 INFO L231 Difference]: Finished difference. Result has 287 places, 419 transitions, 5399 flow [2025-04-13 20:35:14,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4842, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5399, PETRI_PLACES=287, PETRI_TRANSITIONS=419} [2025-04-13 20:35:14,461 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 257 predicate places. [2025-04-13 20:35:14,461 INFO L485 AbstractCegarLoop]: Abstraction has has 287 places, 419 transitions, 5399 flow [2025-04-13 20:35:14,461 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 states have internal predecessors, (140), 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-04-13 20:35:14,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:14,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:14,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 20:35:14,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-04-13 20:35:14,662 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:14,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:14,662 INFO L85 PathProgramCache]: Analyzing trace with hash 623467732, now seen corresponding path program 36 times [2025-04-13 20:35:14,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:14,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596848977] [2025-04-13 20:35:14,662 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:35:14,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:14,669 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:14,678 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:14,678 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:35:14,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:35:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:18,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596848977] [2025-04-13 20:35:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596848977] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:18,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898394075] [2025-04-13 20:35:18,569 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:35:18,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:18,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:18,571 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:35:18,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 20:35:18,655 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:18,676 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:18,676 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:35:18,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:18,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:35:18,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:21,617 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:35:21,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:35:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:35:21,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:23,031 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:35:23,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-13 20:35:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:35:24,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898394075] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:35:24,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:35:24,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 21 [2025-04-13 20:35:24,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289714563] [2025-04-13 20:35:24,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:35:24,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:35:24,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:24,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:35:24,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:35:24,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:35:24,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 419 transitions, 5399 flow. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 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-04-13 20:35:24,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:24,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:35:24,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:33,639 INFO L116 PetriNetUnfolderBase]: 4145/5994 cut-off events. [2025-04-13 20:35:33,639 INFO L117 PetriNetUnfolderBase]: For 157657/157657 co-relation queries the response was YES. [2025-04-13 20:35:33,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35875 conditions, 5994 events. 4145/5994 cut-off events. For 157657/157657 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 30620 event pairs, 1288 based on Foata normal form. 1/5995 useless extension candidates. Maximal degree in co-relation 35706. Up to 5736 conditions per place. [2025-04-13 20:35:33,696 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 405 selfloop transitions, 62 changer transitions 1/468 dead transitions. [2025-04-13 20:35:33,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 468 transitions, 7110 flow [2025-04-13 20:35:33,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:35:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:35:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2025-04-13 20:35:33,697 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30444444444444446 [2025-04-13 20:35:33,697 INFO L175 Difference]: Start difference. First operand has 287 places, 419 transitions, 5399 flow. Second operand 15 states and 137 transitions. [2025-04-13 20:35:33,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 468 transitions, 7110 flow [2025-04-13 20:35:34,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 468 transitions, 6738 flow, removed 131 selfloop flow, removed 7 redundant places. [2025-04-13 20:35:34,034 INFO L231 Difference]: Finished difference. Result has 297 places, 433 transitions, 5859 flow [2025-04-13 20:35:34,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5057, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5859, PETRI_PLACES=297, PETRI_TRANSITIONS=433} [2025-04-13 20:35:34,035 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 267 predicate places. [2025-04-13 20:35:34,035 INFO L485 AbstractCegarLoop]: Abstraction has has 297 places, 433 transitions, 5859 flow [2025-04-13 20:35:34,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 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-04-13 20:35:34,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:34,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:34,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 20:35:34,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-04-13 20:35:34,236 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:34,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash -546339240, now seen corresponding path program 37 times [2025-04-13 20:35:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:34,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860283948] [2025-04-13 20:35:34,236 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:35:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:34,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:35:34,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:34,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:35:34,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:35:38,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:38,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860283948] [2025-04-13 20:35:38,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860283948] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:38,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447665181] [2025-04-13 20:35:38,615 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:35:38,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:38,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:38,617 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:35:38,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 20:35:38,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:35:38,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:38,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:35:38,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:38,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 20:35:38,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:38,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:35:39,294 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-13 20:35:39,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-13 20:35:39,758 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:35:39,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:35:42,763 INFO L325 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-04-13 20:35:42,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:35:43,318 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-04-13 20:35:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:35:43,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:47,984 WARN L849 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (~C~0.offset Int)) (let ((.cse0 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse1 (select (select |c_#memory_int#1| c_~A~0.base) (+ .cse0 ~A~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 c_~B~0.offset)))) (= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ .cse1 .cse2 c_~csum~0))))) is different from false [2025-04-13 20:35:52,067 WARN L849 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int#1| c_~A~0.base) ~A~0.offset)) (.cse1 (select (select |c_#memory_int#1| c_~B~0.base) c_~B~0.offset))) (= (+ (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) c_~asum~0 c_~bsum~0) (+ .cse0 .cse1 c_~csum~0)))) is different from false [2025-04-13 20:35:52,577 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:35:52,577 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2025-04-13 20:35:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-04-13 20:35:56,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447665181] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:35:56,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:35:56,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2025-04-13 20:35:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105299915] [2025-04-13 20:35:56,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:35:56,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:35:56,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:56,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:35:56,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=793, Unknown=2, NotChecked=118, Total=1056 [2025-04-13 20:35:56,161 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:35:56,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 433 transitions, 5859 flow. Second operand has 33 states, 33 states have (on average 5.0) internal successors, (165), 33 states have internal predecessors, (165), 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-04-13 20:35:56,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:56,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:35:56,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:08,402 INFO L116 PetriNetUnfolderBase]: 4215/6095 cut-off events. [2025-04-13 20:36:08,402 INFO L117 PetriNetUnfolderBase]: For 169781/169781 co-relation queries the response was YES. [2025-04-13 20:36:08,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36708 conditions, 6095 events. 4215/6095 cut-off events. For 169781/169781 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 31252 event pairs, 1332 based on Foata normal form. 1/6096 useless extension candidates. Maximal degree in co-relation 36536. Up to 5915 conditions per place. [2025-04-13 20:36:08,456 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 407 selfloop transitions, 59 changer transitions 1/467 dead transitions. [2025-04-13 20:36:08,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 467 transitions, 7289 flow [2025-04-13 20:36:08,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:36:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:36:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 129 transitions. [2025-04-13 20:36:08,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2866666666666667 [2025-04-13 20:36:08,458 INFO L175 Difference]: Start difference. First operand has 297 places, 433 transitions, 5859 flow. Second operand 15 states and 129 transitions. [2025-04-13 20:36:08,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 467 transitions, 7289 flow [2025-04-13 20:36:08,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 467 transitions, 6641 flow, removed 287 selfloop flow, removed 10 redundant places. [2025-04-13 20:36:08,808 INFO L231 Difference]: Finished difference. Result has 304 places, 440 transitions, 5777 flow [2025-04-13 20:36:08,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5211, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5777, PETRI_PLACES=304, PETRI_TRANSITIONS=440} [2025-04-13 20:36:08,809 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2025-04-13 20:36:08,809 INFO L485 AbstractCegarLoop]: Abstraction has has 304 places, 440 transitions, 5777 flow [2025-04-13 20:36:08,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.0) internal successors, (165), 33 states have internal predecessors, (165), 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-04-13 20:36:08,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:08,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:08,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 20:36:09,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-13 20:36:09,010 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:09,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:09,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1411828054, now seen corresponding path program 38 times [2025-04-13 20:36:09,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:09,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163913520] [2025-04-13 20:36:09,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:36:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:09,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:36:09,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:36:09,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:36:09,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:36:13,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:13,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163913520] [2025-04-13 20:36:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163913520] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:13,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066519236] [2025-04-13 20:36:13,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:36:13,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:13,437 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:36:13,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 20:36:13,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:36:13,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:36:13,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:36:13,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:13,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 20:36:13,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:13,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:36:14,237 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-13 20:36:14,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-13 20:36:14,847 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:36:14,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:36:16,782 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-13 20:36:16,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-13 20:36:17,912 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:36:17,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 94 [2025-04-13 20:36:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:36:18,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:22,621 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:36:22,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 40 [2025-04-13 20:36:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:36:25,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066519236] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:36:25,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:36:25,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 25 [2025-04-13 20:36:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187884734] [2025-04-13 20:36:25,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:36:25,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:36:25,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:25,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:36:25,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:36:25,241 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:36:25,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 440 transitions, 5777 flow. Second operand has 27 states, 27 states have (on average 5.0) internal successors, (135), 27 states have internal predecessors, (135), 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-04-13 20:36:25,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:25,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:36:25,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:35,357 INFO L116 PetriNetUnfolderBase]: 4285/6196 cut-off events. [2025-04-13 20:36:35,358 INFO L117 PetriNetUnfolderBase]: For 158765/158765 co-relation queries the response was YES. [2025-04-13 20:36:35,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36182 conditions, 6196 events. 4285/6196 cut-off events. For 158765/158765 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 31797 event pairs, 1137 based on Foata normal form. 1/6197 useless extension candidates. Maximal degree in co-relation 36007. Up to 5904 conditions per place. [2025-04-13 20:36:35,433 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 391 selfloop transitions, 83 changer transitions 1/475 dead transitions. [2025-04-13 20:36:35,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 475 transitions, 7241 flow [2025-04-13 20:36:35,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:36:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:36:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2025-04-13 20:36:35,434 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2911111111111111 [2025-04-13 20:36:35,434 INFO L175 Difference]: Start difference. First operand has 304 places, 440 transitions, 5777 flow. Second operand 15 states and 131 transitions. [2025-04-13 20:36:35,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 475 transitions, 7241 flow [2025-04-13 20:36:35,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 475 transitions, 6783 flow, removed 195 selfloop flow, removed 10 redundant places. [2025-04-13 20:36:35,839 INFO L231 Difference]: Finished difference. Result has 311 places, 447 transitions, 5948 flow [2025-04-13 20:36:35,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5319, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5948, PETRI_PLACES=311, PETRI_TRANSITIONS=447} [2025-04-13 20:36:35,840 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 281 predicate places. [2025-04-13 20:36:35,840 INFO L485 AbstractCegarLoop]: Abstraction has has 311 places, 447 transitions, 5948 flow [2025-04-13 20:36:35,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.0) internal successors, (135), 27 states have internal predecessors, (135), 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-04-13 20:36:35,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:35,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:35,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 20:36:36,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:36,041 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:36,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash -510034348, now seen corresponding path program 39 times [2025-04-13 20:36:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:36,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642703677] [2025-04-13 20:36:36,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:36:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:36,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:36:36,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:36:36,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:36:36,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:36:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:40,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642703677] [2025-04-13 20:36:40,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642703677] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:40,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234628258] [2025-04-13 20:36:40,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:36:40,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:40,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:40,396 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:36:40,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 20:36:40,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:36:40,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:36:40,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:36:40,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:40,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:36:40,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:43,412 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:36:43,412 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 20:36:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:36:43,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:44,855 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:36:44,855 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-13 20:36:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:36:46,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234628258] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:36:46,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:36:46,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 20 [2025-04-13 20:36:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345572140] [2025-04-13 20:36:46,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:36:46,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:36:46,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:46,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:36:46,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:36:46,277 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:36:46,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 447 transitions, 5948 flow. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 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-04-13 20:36:46,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:46,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:36:46,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:57,416 INFO L116 PetriNetUnfolderBase]: 4360/6305 cut-off events. [2025-04-13 20:36:57,416 INFO L117 PetriNetUnfolderBase]: For 161608/161608 co-relation queries the response was YES. [2025-04-13 20:36:57,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36712 conditions, 6305 events. 4360/6305 cut-off events. For 161608/161608 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 32512 event pairs, 1387 based on Foata normal form. 1/6306 useless extension candidates. Maximal degree in co-relation 36533. Up to 6118 conditions per place. [2025-04-13 20:36:57,554 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 422 selfloop transitions, 59 changer transitions 1/482 dead transitions. [2025-04-13 20:36:57,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 482 transitions, 7259 flow [2025-04-13 20:36:57,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:36:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:36:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2025-04-13 20:36:57,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2911111111111111 [2025-04-13 20:36:57,555 INFO L175 Difference]: Start difference. First operand has 311 places, 447 transitions, 5948 flow. Second operand 15 states and 131 transitions. [2025-04-13 20:36:57,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 482 transitions, 7259 flow [2025-04-13 20:36:57,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 482 transitions, 6757 flow, removed 202 selfloop flow, removed 10 redundant places. [2025-04-13 20:36:57,930 INFO L231 Difference]: Finished difference. Result has 317 places, 453 transitions, 5851 flow [2025-04-13 20:36:57,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5446, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5851, PETRI_PLACES=317, PETRI_TRANSITIONS=453} [2025-04-13 20:36:57,930 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 287 predicate places. [2025-04-13 20:36:57,931 INFO L485 AbstractCegarLoop]: Abstraction has has 317 places, 453 transitions, 5851 flow [2025-04-13 20:36:57,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 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-04-13 20:36:57,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:57,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:57,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 20:36:58,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:58,132 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:58,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash 530201450, now seen corresponding path program 40 times [2025-04-13 20:36:58,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:58,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182645861] [2025-04-13 20:36:58,132 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:36:58,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:58,140 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:36:58,148 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:36:58,148 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:36:58,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:37:01,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:01,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182645861] [2025-04-13 20:37:01,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182645861] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:01,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009312096] [2025-04-13 20:37:01,242 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:37:01,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:01,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:01,244 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:37:01,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 20:37:01,330 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:37:01,352 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:37:01,352 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:37:01,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:01,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:37:01,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:03,851 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:37:03,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-04-13 20:37:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:37:03,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2025-04-13 20:37:40,379 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:37:40,387 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:37:40,779 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:37:40,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-04-13 20:37:40,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-13 20:37:40,980 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 21 known predicates. [2025-04-13 20:37:40,983 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:37:40,983 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:37:40,983 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:37:40,983 INFO L422 BasicCegarLoop]: Path program histogram: [40, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:40,997 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:37:40,997 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:37:41,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:37:41 BasicIcfg [2025-04-13 20:37:41,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:37:41,010 INFO L158 Benchmark]: Toolchain (without parser) took 856350.73ms. Allocated memory was 155.2MB in the beginning and 658.5MB in the end (delta: 503.3MB). Free memory was 109.3MB in the beginning and 147.2MB in the end (delta: -37.9MB). Peak memory consumption was 463.4MB. Max. memory is 8.0GB. [2025-04-13 20:37:41,010 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:37:41,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.39ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 94.3MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:37:41,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.14ms. Allocated memory is still 155.2MB. Free memory was 94.3MB in the beginning and 91.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:37:41,010 INFO L158 Benchmark]: Boogie Preprocessor took 40.41ms. Allocated memory is still 155.2MB. Free memory was 91.6MB in the beginning and 89.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:37:41,010 INFO L158 Benchmark]: RCFGBuilder took 807.27ms. Allocated memory is still 155.2MB. Free memory was 89.2MB in the beginning and 69.1MB in the end (delta: 20.1MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. [2025-04-13 20:37:41,011 INFO L158 Benchmark]: TraceAbstraction took 855218.55ms. Allocated memory was 155.2MB in the beginning and 658.5MB in the end (delta: 503.3MB). Free memory was 68.3MB in the beginning and 147.2MB in the end (delta: -78.9MB). Peak memory consumption was 422.3MB. Max. memory is 8.0GB. [2025-04-13 20:37:41,011 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.39ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 94.3MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.14ms. Allocated memory is still 155.2MB. Free memory was 94.3MB in the beginning and 91.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.41ms. Allocated memory is still 155.2MB. Free memory was 91.6MB in the beginning and 89.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 807.27ms. Allocated memory is still 155.2MB. Free memory was 89.2MB in the beginning and 69.1MB in the end (delta: 20.1MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. * TraceAbstraction took 855218.55ms. Allocated memory was 155.2MB in the beginning and 658.5MB in the end (delta: 503.3MB). Free memory was 68.3MB in the beginning and 147.2MB in the end (delta: -78.9MB). Peak memory consumption was 422.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 21 known predicates. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 21 known predicates. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 21 known predicates. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 21 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 37 locations, 45 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 855.1s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 40, EmptinessCheckTime: 0.0s, AutomataDifference: 241.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2382 SdHoareTripleChecker+Valid, 169.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2382 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 166.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 764 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 332 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30320 IncrementalHoareTripleChecker+Invalid, 31416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 332 mSolverCounterUnsat, 0 mSDtfsCounter, 30320 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2828 GetRequests, 1622 SyntacticMatches, 12 SemanticMatches, 1194 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 9670 ImplicationChecksByTransitivity, 434.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5948occurred in iteration=45, InterpolantAutomatonStates: 584, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 556.7s InterpolantComputationTime, 2257 NumberOfCodeBlocks, 2257 NumberOfCodeBlocksAsserted, 152 NumberOfCheckSat, 3214 ConstructedInterpolants, 202 QuantifiedInterpolants, 49231 SizeOfPredicates, 567 NumberOfNonLiveVariables, 12143 ConjunctsInSsa, 1711 ConjunctsInUnsatCore, 130 InterpolantComputations, 7 PerfectInterpolantSequences, 300/780 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown