./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:19:35,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:19:35,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:19:35,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:19:35,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:19:36,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:19:36,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:19:36,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:19:36,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:19:36,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:19:36,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:19:36,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:19:36,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:19:36,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:19:36,010 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:19:36,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:19:36,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:19:36,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:19:36,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:19:36,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:19:36,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:19:36,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:19:36,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:19:36,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:19:36,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:19:36,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:19:36,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:19:36,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:19:36,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:19:36,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:19:36,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:19:36,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:19:36,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:19:36,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:19:36,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:19:36,012 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:19:36,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:19:36,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:19:36,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:19:36,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:19:36,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:19:36,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:19:36,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:19:36,013 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2025-03-17 06:19:36,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:19:36,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:19:36,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:19:36,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:19:36,248 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:19:36,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2025-03-17 06:19:37,400 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffa6f9f5/bd4735321a1247a8a2a67100bf552818/FLAGc4a975d48 [2025-03-17 06:19:37,673 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:19:37,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2025-03-17 06:19:37,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffa6f9f5/bd4735321a1247a8a2a67100bf552818/FLAGc4a975d48 [2025-03-17 06:19:37,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffa6f9f5/bd4735321a1247a8a2a67100bf552818 [2025-03-17 06:19:37,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:19:37,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:19:37,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:19:37,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:19:37,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:19:37,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:19:37" (1/1) ... [2025-03-17 06:19:37,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f45945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:37, skipping insertion in model container [2025-03-17 06:19:37,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:19:37" (1/1) ... [2025-03-17 06:19:38,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:19:38,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i[30952,30965] [2025-03-17 06:19:38,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:19:38,214 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:19:38,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i[30952,30965] [2025-03-17 06:19:38,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:19:38,259 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:19:38,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38 WrapperNode [2025-03-17 06:19:38,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:19:38,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:19:38,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:19:38,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:19:38,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,292 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-03-17 06:19:38,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:19:38,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:19:38,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:19:38,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:19:38,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,314 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 06:19:38,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,319 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:19:38,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:19:38,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:19:38,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:19:38,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (1/1) ... [2025-03-17 06:19:38,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:19:38,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:19:38,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:19:38,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:19:38,370 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 06:19:38,370 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 06:19:38,371 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 06:19:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 06:19:38,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:19:38,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:19:38,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:19:38,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:19:38,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:19:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:19:38,372 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:19:38,448 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:19:38,450 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:19:38,570 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:19:38,570 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:19:38,649 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:19:38,650 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:19:38,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:19:38 BoogieIcfgContainer [2025-03-17 06:19:38,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:19:38,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:19:38,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:19:38,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:19:38,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:19:37" (1/3) ... [2025-03-17 06:19:38,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c96118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:19:38, skipping insertion in model container [2025-03-17 06:19:38,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:19:38" (2/3) ... [2025-03-17 06:19:38,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c96118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:19:38, skipping insertion in model container [2025-03-17 06:19:38,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:19:38" (3/3) ... [2025-03-17 06:19:38,661 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-03-17 06:19:38,673 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:19:38,674 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-2.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-17 06:19:38,674 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:19:38,711 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:19:38,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-03-17 06:19:38,763 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-17 06:19:38,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:19:38,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-03-17 06:19:38,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-03-17 06:19:38,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-03-17 06:19:38,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:19:38,796 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72447606, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:19:38,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-17 06:19:38,805 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:19:38,805 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-17 06:19:38,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:19:38,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:38,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:38,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:38,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:38,811 INFO L85 PathProgramCache]: Analyzing trace with hash 355335699, now seen corresponding path program 1 times [2025-03-17 06:19:38,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746503536] [2025-03-17 06:19:38,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:19:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:38,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:19:38,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:19:38,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:19:38,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:39,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:39,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746503536] [2025-03-17 06:19:39,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746503536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:19:39,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:19:39,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:19:39,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952512544] [2025-03-17 06:19:39,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:19:39,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:19:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:39,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:19:39,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:19:39,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:39,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:39,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:39,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:39,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:39,366 INFO L124 PetriNetUnfolderBase]: 321/540 cut-off events. [2025-03-17 06:19:39,366 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:19:39,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 540 events. 321/540 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2120 event pairs, 62 based on Foata normal form. 12/535 useless extension candidates. Maximal degree in co-relation 1042. Up to 221 conditions per place. [2025-03-17 06:19:39,370 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2025-03-17 06:19:39,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2025-03-17 06:19:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:19:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:19:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-03-17 06:19:39,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-17 06:19:39,382 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2025-03-17 06:19:39,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2025-03-17 06:19:39,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:19:39,388 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2025-03-17 06:19:39,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2025-03-17 06:19:39,394 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-03-17 06:19:39,394 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2025-03-17 06:19:39,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:39,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:39,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:39,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:19:39,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:39,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash 964778290, now seen corresponding path program 1 times [2025-03-17 06:19:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765751348] [2025-03-17 06:19:39,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:19:39,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:39,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 06:19:39,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 06:19:39,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:19:39,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765751348] [2025-03-17 06:19:39,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765751348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:19:39,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:19:39,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:19:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071877655] [2025-03-17 06:19:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:19:39,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:19:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:39,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:19:39,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:19:39,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:39,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-03-17 06:19:39,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:39,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:39,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:39,777 INFO L124 PetriNetUnfolderBase]: 382/687 cut-off events. [2025-03-17 06:19:39,777 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-03-17 06:19:39,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 687 events. 382/687 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2905 event pairs, 65 based on Foata normal form. 27/710 useless extension candidates. Maximal degree in co-relation 1570. Up to 246 conditions per place. [2025-03-17 06:19:39,783 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2025-03-17 06:19:39,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2025-03-17 06:19:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:19:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:19:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-03-17 06:19:39,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-17 06:19:39,786 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2025-03-17 06:19:39,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2025-03-17 06:19:39,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-17 06:19:39,790 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2025-03-17 06:19:39,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2025-03-17 06:19:39,792 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-03-17 06:19:39,792 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2025-03-17 06:19:39,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-03-17 06:19:39,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:39,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:39,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:19:39,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:39,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1319887630, now seen corresponding path program 2 times [2025-03-17 06:19:39,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:39,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752457302] [2025-03-17 06:19:39,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:19:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:39,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-17 06:19:39,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 06:19:39,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:19:39,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:39,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:39,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752457302] [2025-03-17 06:19:39,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752457302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:19:39,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:19:39,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:19:39,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202532107] [2025-03-17 06:19:39,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:19:39,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:19:39,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:39,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:19:39,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:19:39,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:39,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-03-17 06:19:39,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:39,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:39,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:40,093 INFO L124 PetriNetUnfolderBase]: 328/603 cut-off events. [2025-03-17 06:19:40,094 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2025-03-17 06:19:40,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1732 conditions, 603 events. 328/603 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2509 event pairs, 65 based on Foata normal form. 45/644 useless extension candidates. Maximal degree in co-relation 1711. Up to 234 conditions per place. [2025-03-17 06:19:40,098 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2025-03-17 06:19:40,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2025-03-17 06:19:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:19:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:19:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-03-17 06:19:40,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-03-17 06:19:40,101 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2025-03-17 06:19:40,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2025-03-17 06:19:40,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-17 06:19:40,106 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2025-03-17 06:19:40,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-03-17 06:19:40,107 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-03-17 06:19:40,107 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2025-03-17 06:19:40,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-03-17 06:19:40,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:40,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:40,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:19:40,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:40,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash -443489336, now seen corresponding path program 1 times [2025-03-17 06:19:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:40,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202983473] [2025-03-17 06:19:40,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:19:40,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:40,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 06:19:40,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 06:19:40,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:19:40,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:40,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:40,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202983473] [2025-03-17 06:19:40,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202983473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:19:40,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:19:40,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:19:40,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510951187] [2025-03-17 06:19:40,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:19:40,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:19:40,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:40,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:19:40,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:19:40,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:40,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:40,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:40,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:40,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:40,432 INFO L124 PetriNetUnfolderBase]: 337/612 cut-off events. [2025-03-17 06:19:40,432 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2025-03-17 06:19:40,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 612 events. 337/612 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2541 event pairs, 74 based on Foata normal form. 18/626 useless extension candidates. Maximal degree in co-relation 1911. Up to 237 conditions per place. [2025-03-17 06:19:40,435 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 16 changer transitions 24/89 dead transitions. [2025-03-17 06:19:40,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 607 flow [2025-03-17 06:19:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:19:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 06:19:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-03-17 06:19:40,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-03-17 06:19:40,436 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 11 states and 135 transitions. [2025-03-17 06:19:40,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 607 flow [2025-03-17 06:19:40,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 540 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-17 06:19:40,445 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 279 flow [2025-03-17 06:19:40,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=279, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2025-03-17 06:19:40,446 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-03-17 06:19:40,446 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 279 flow [2025-03-17 06:19:40,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:40,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:40,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:40,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:19:40,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:40,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:40,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1513461300, now seen corresponding path program 2 times [2025-03-17 06:19:40,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:40,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103689846] [2025-03-17 06:19:40,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:19:40,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:40,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-17 06:19:40,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 06:19:40,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:19:40,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:40,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:40,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103689846] [2025-03-17 06:19:40,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103689846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:19:40,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:19:40,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:19:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540965812] [2025-03-17 06:19:40,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:19:40,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:19:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:40,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:19:40,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:19:40,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:40,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:40,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:40,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:40,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:40,732 INFO L124 PetriNetUnfolderBase]: 409/742 cut-off events. [2025-03-17 06:19:40,732 INFO L125 PetriNetUnfolderBase]: For 2292/2292 co-relation queries the response was YES. [2025-03-17 06:19:40,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 742 events. 409/742 cut-off events. For 2292/2292 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3153 event pairs, 71 based on Foata normal form. 27/764 useless extension candidates. Maximal degree in co-relation 2412. Up to 220 conditions per place. [2025-03-17 06:19:40,736 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 43 selfloop transitions, 18 changer transitions 28/92 dead transitions. [2025-03-17 06:19:40,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 685 flow [2025-03-17 06:19:40,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:19:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 06:19:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-03-17 06:19:40,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-03-17 06:19:40,737 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 279 flow. Second operand 10 states and 125 transitions. [2025-03-17 06:19:40,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 685 flow [2025-03-17 06:19:40,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 633 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-03-17 06:19:40,743 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 347 flow [2025-03-17 06:19:40,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=347, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2025-03-17 06:19:40,744 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 37 predicate places. [2025-03-17 06:19:40,744 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 347 flow [2025-03-17 06:19:40,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:40,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:40,744 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:40,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:19:40,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:40,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1437571864, now seen corresponding path program 1 times [2025-03-17 06:19:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:40,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668949936] [2025-03-17 06:19:40,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:19:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:40,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 06:19:40,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 06:19:40,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:19:40,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:40,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:40,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668949936] [2025-03-17 06:19:40,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668949936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:19:40,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:19:40,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:19:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342933002] [2025-03-17 06:19:40,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:19:40,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:19:40,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:40,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:19:40,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:19:40,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:40,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 347 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:40,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:40,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:40,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:41,021 INFO L124 PetriNetUnfolderBase]: 436/793 cut-off events. [2025-03-17 06:19:41,021 INFO L125 PetriNetUnfolderBase]: For 3583/3583 co-relation queries the response was YES. [2025-03-17 06:19:41,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2909 conditions, 793 events. 436/793 cut-off events. For 3583/3583 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3439 event pairs, 59 based on Foata normal form. 18/806 useless extension candidates. Maximal degree in co-relation 2878. Up to 154 conditions per place. [2025-03-17 06:19:41,038 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 24 changer transitions 23/94 dead transitions. [2025-03-17 06:19:41,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 795 flow [2025-03-17 06:19:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:19:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 06:19:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-03-17 06:19:41,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-03-17 06:19:41,039 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 347 flow. Second operand 10 states and 125 transitions. [2025-03-17 06:19:41,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 795 flow [2025-03-17 06:19:41,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 751 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-17 06:19:41,046 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 435 flow [2025-03-17 06:19:41,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=435, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2025-03-17 06:19:41,046 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 42 predicate places. [2025-03-17 06:19:41,047 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 435 flow [2025-03-17 06:19:41,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:41,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:41,047 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:41,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:19:41,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:41,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash -245987901, now seen corresponding path program 1 times [2025-03-17 06:19:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:41,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274432791] [2025-03-17 06:19:41,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:19:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:41,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 06:19:41,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 06:19:41,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:19:41,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:41,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274432791] [2025-03-17 06:19:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274432791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:19:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484996561] [2025-03-17 06:19:41,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:19:41,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:19:41,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:19:41,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:19:41,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:19:41,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 06:19:41,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 06:19:41,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:19:41,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:41,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 06:19:41,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:19:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:41,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:19:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:41,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484996561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:19:41,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:19:41,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-17 06:19:41,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759096479] [2025-03-17 06:19:41,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:19:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:19:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:41,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:19:41,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:19:41,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:41,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 435 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:41,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:41,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:41,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:41,761 INFO L124 PetriNetUnfolderBase]: 580/1068 cut-off events. [2025-03-17 06:19:41,761 INFO L125 PetriNetUnfolderBase]: For 8203/8203 co-relation queries the response was YES. [2025-03-17 06:19:41,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4410 conditions, 1068 events. 580/1068 cut-off events. For 8203/8203 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4469 event pairs, 149 based on Foata normal form. 63/1127 useless extension candidates. Maximal degree in co-relation 4377. Up to 504 conditions per place. [2025-03-17 06:19:41,768 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 65 selfloop transitions, 17 changer transitions 67/152 dead transitions. [2025-03-17 06:19:41,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 152 transitions, 1435 flow [2025-03-17 06:19:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 06:19:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 06:19:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-03-17 06:19:41,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-03-17 06:19:41,770 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 435 flow. Second operand 19 states and 231 transitions. [2025-03-17 06:19:41,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 152 transitions, 1435 flow [2025-03-17 06:19:41,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 152 transitions, 1343 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-03-17 06:19:41,783 INFO L231 Difference]: Finished difference. Result has 90 places, 52 transitions, 559 flow [2025-03-17 06:19:41,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=559, PETRI_PLACES=90, PETRI_TRANSITIONS=52} [2025-03-17 06:19:41,785 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-03-17 06:19:41,785 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 52 transitions, 559 flow [2025-03-17 06:19:41,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:41,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:41,785 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:41,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:19:41,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:19:41,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:41,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1752855453, now seen corresponding path program 2 times [2025-03-17 06:19:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:41,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677328941] [2025-03-17 06:19:41,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:19:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:41,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-17 06:19:41,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 06:19:41,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:19:41,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:42,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:42,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677328941] [2025-03-17 06:19:42,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677328941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:19:42,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:19:42,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:19:42,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211483524] [2025-03-17 06:19:42,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:19:42,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:19:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:42,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:19:42,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:19:42,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:42,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 52 transitions, 559 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:42,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:42,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:42,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:42,375 INFO L124 PetriNetUnfolderBase]: 661/1235 cut-off events. [2025-03-17 06:19:42,375 INFO L125 PetriNetUnfolderBase]: For 21079/21079 co-relation queries the response was YES. [2025-03-17 06:19:42,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6357 conditions, 1235 events. 661/1235 cut-off events. For 21079/21079 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5748 event pairs, 144 based on Foata normal form. 27/1258 useless extension candidates. Maximal degree in co-relation 6313. Up to 501 conditions per place. [2025-03-17 06:19:42,383 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 77 selfloop transitions, 23 changer transitions 31/134 dead transitions. [2025-03-17 06:19:42,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 134 transitions, 1579 flow [2025-03-17 06:19:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:19:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 06:19:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-03-17 06:19:42,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-03-17 06:19:42,384 INFO L175 Difference]: Start difference. First operand has 90 places, 52 transitions, 559 flow. Second operand 15 states and 187 transitions. [2025-03-17 06:19:42,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 134 transitions, 1579 flow [2025-03-17 06:19:42,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 134 transitions, 1247 flow, removed 155 selfloop flow, removed 12 redundant places. [2025-03-17 06:19:42,402 INFO L231 Difference]: Finished difference. Result has 92 places, 58 transitions, 617 flow [2025-03-17 06:19:42,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=617, PETRI_PLACES=92, PETRI_TRANSITIONS=58} [2025-03-17 06:19:42,402 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 66 predicate places. [2025-03-17 06:19:42,403 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 58 transitions, 617 flow [2025-03-17 06:19:42,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:42,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:42,403 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:42,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:19:42,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:42,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash 419544819, now seen corresponding path program 3 times [2025-03-17 06:19:42,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:42,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12146482] [2025-03-17 06:19:42,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:19:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:42,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-03-17 06:19:42,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 06:19:42,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:19:42,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12146482] [2025-03-17 06:19:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12146482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:19:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:19:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:19:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533173264] [2025-03-17 06:19:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:19:42,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:19:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:42,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:19:42,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:19:42,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:42,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 58 transitions, 617 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:42,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:42,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:42,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:42,759 INFO L124 PetriNetUnfolderBase]: 598/1127 cut-off events. [2025-03-17 06:19:42,759 INFO L125 PetriNetUnfolderBase]: For 15552/15552 co-relation queries the response was YES. [2025-03-17 06:19:42,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5381 conditions, 1127 events. 598/1127 cut-off events. For 15552/15552 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5166 event pairs, 150 based on Foata normal form. 45/1168 useless extension candidates. Maximal degree in co-relation 5337. Up to 471 conditions per place. [2025-03-17 06:19:42,780 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 65 selfloop transitions, 24 changer transitions 39/131 dead transitions. [2025-03-17 06:19:42,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 131 transitions, 1473 flow [2025-03-17 06:19:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:19:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 06:19:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 173 transitions. [2025-03-17 06:19:42,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5148809523809523 [2025-03-17 06:19:42,782 INFO L175 Difference]: Start difference. First operand has 92 places, 58 transitions, 617 flow. Second operand 14 states and 173 transitions. [2025-03-17 06:19:42,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 131 transitions, 1473 flow [2025-03-17 06:19:42,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 131 transitions, 1293 flow, removed 74 selfloop flow, removed 10 redundant places. [2025-03-17 06:19:42,799 INFO L231 Difference]: Finished difference. Result has 97 places, 59 transitions, 614 flow [2025-03-17 06:19:42,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=614, PETRI_PLACES=97, PETRI_TRANSITIONS=59} [2025-03-17 06:19:42,800 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 71 predicate places. [2025-03-17 06:19:42,800 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 59 transitions, 614 flow [2025-03-17 06:19:42,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:42,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:42,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:42,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:19:42,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:42,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:42,801 INFO L85 PathProgramCache]: Analyzing trace with hash 286114721, now seen corresponding path program 1 times [2025-03-17 06:19:42,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:42,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44848064] [2025-03-17 06:19:42,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:19:42,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:42,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:19:42,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:19:42,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:19:42,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:42,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:42,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44848064] [2025-03-17 06:19:42,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44848064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:19:42,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14708686] [2025-03-17 06:19:42,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:19:42,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:19:42,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:19:42,889 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:19:42,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:19:42,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:19:42,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:19:42,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:19:42,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:42,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:19:42,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:19:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:42,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:19:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:43,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14708686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:19:43,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:19:43,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-17 06:19:43,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883254648] [2025-03-17 06:19:43,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:19:43,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:19:43,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:43,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:19:43,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:19:43,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:43,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 59 transitions, 614 flow. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:43,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:43,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:43,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:43,700 INFO L124 PetriNetUnfolderBase]: 841/1575 cut-off events. [2025-03-17 06:19:43,700 INFO L125 PetriNetUnfolderBase]: For 27476/27476 co-relation queries the response was YES. [2025-03-17 06:19:43,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8184 conditions, 1575 events. 841/1575 cut-off events. For 27476/27476 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7782 event pairs, 36 based on Foata normal form. 72/1643 useless extension candidates. Maximal degree in co-relation 8138. Up to 255 conditions per place. [2025-03-17 06:19:43,709 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 79 selfloop transitions, 55 changer transitions 88/225 dead transitions. [2025-03-17 06:19:43,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 225 transitions, 2634 flow [2025-03-17 06:19:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 06:19:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-17 06:19:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 341 transitions. [2025-03-17 06:19:43,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5074404761904762 [2025-03-17 06:19:43,710 INFO L175 Difference]: Start difference. First operand has 97 places, 59 transitions, 614 flow. Second operand 28 states and 341 transitions. [2025-03-17 06:19:43,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 225 transitions, 2634 flow [2025-03-17 06:19:43,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 225 transitions, 2456 flow, removed 67 selfloop flow, removed 12 redundant places. [2025-03-17 06:19:43,737 INFO L231 Difference]: Finished difference. Result has 127 places, 76 transitions, 1102 flow [2025-03-17 06:19:43,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1102, PETRI_PLACES=127, PETRI_TRANSITIONS=76} [2025-03-17 06:19:43,737 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 101 predicate places. [2025-03-17 06:19:43,738 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 76 transitions, 1102 flow [2025-03-17 06:19:43,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:43,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:43,738 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:43,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:19:43,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 06:19:43,942 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:43,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1629126176, now seen corresponding path program 2 times [2025-03-17 06:19:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:43,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687963097] [2025-03-17 06:19:43,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:19:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:43,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 06:19:43,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 06:19:43,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:19:43,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:44,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687963097] [2025-03-17 06:19:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687963097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:19:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645136654] [2025-03-17 06:19:44,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:19:44,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:19:44,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:19:44,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:19:44,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:19:44,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 06:19:44,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 06:19:44,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:19:44,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:44,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 06:19:44,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:19:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:44,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:19:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:44,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645136654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:19:44,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:19:44,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-17 06:19:44,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208722332] [2025-03-17 06:19:44,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:19:44,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:19:44,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:44,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:19:44,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:19:44,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:44,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 76 transitions, 1102 flow. Second operand has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 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-03-17 06:19:44,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:44,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:44,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:45,104 INFO L124 PetriNetUnfolderBase]: 1417/2670 cut-off events. [2025-03-17 06:19:45,104 INFO L125 PetriNetUnfolderBase]: For 116610/116610 co-relation queries the response was YES. [2025-03-17 06:19:45,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19112 conditions, 2670 events. 1417/2670 cut-off events. For 116610/116610 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 14801 event pairs, 54 based on Foata normal form. 90/2756 useless extension candidates. Maximal degree in co-relation 19051. Up to 534 conditions per place. [2025-03-17 06:19:45,126 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 120 selfloop transitions, 91 changer transitions 110/324 dead transitions. [2025-03-17 06:19:45,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 324 transitions, 5645 flow [2025-03-17 06:19:45,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 06:19:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-17 06:19:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 456 transitions. [2025-03-17 06:19:45,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-03-17 06:19:45,128 INFO L175 Difference]: Start difference. First operand has 127 places, 76 transitions, 1102 flow. Second operand 37 states and 456 transitions. [2025-03-17 06:19:45,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 324 transitions, 5645 flow [2025-03-17 06:19:45,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 324 transitions, 4418 flow, removed 583 selfloop flow, removed 17 redundant places. [2025-03-17 06:19:45,251 INFO L231 Difference]: Finished difference. Result has 163 places, 116 transitions, 1998 flow [2025-03-17 06:19:45,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1998, PETRI_PLACES=163, PETRI_TRANSITIONS=116} [2025-03-17 06:19:45,251 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 137 predicate places. [2025-03-17 06:19:45,252 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 116 transitions, 1998 flow [2025-03-17 06:19:45,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 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-03-17 06:19:45,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:45,252 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:45,259 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-03-17 06:19:45,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:19:45,453 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:45,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:45,453 INFO L85 PathProgramCache]: Analyzing trace with hash 728336222, now seen corresponding path program 3 times [2025-03-17 06:19:45,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:45,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390150781] [2025-03-17 06:19:45,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:19:45,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:45,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-17 06:19:45,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:19:45,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 06:19:45,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:45,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:45,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390150781] [2025-03-17 06:19:45,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390150781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:19:45,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938123781] [2025-03-17 06:19:45,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:19:45,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:19:45,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:19:45,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:19:45,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:19:45,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-17 06:19:45,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:19:45,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 06:19:45,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:45,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 06:19:45,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:19:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:45,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:19:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:45,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938123781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:19:45,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:19:45,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-17 06:19:45,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862199838] [2025-03-17 06:19:45,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:19:45,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 06:19:45,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:45,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 06:19:45,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:19:45,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:45,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 116 transitions, 1998 flow. Second operand has 20 states, 20 states have (on average 7.05) internal successors, (141), 20 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:45,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:45,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:45,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:46,676 INFO L124 PetriNetUnfolderBase]: 1570/3046 cut-off events. [2025-03-17 06:19:46,676 INFO L125 PetriNetUnfolderBase]: For 226985/226985 co-relation queries the response was YES. [2025-03-17 06:19:46,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24195 conditions, 3046 events. 1570/3046 cut-off events. For 226985/226985 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 17008 event pairs, 54 based on Foata normal form. 99/3141 useless extension candidates. Maximal degree in co-relation 24118. Up to 615 conditions per place. [2025-03-17 06:19:46,701 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 106 selfloop transitions, 112 changer transitions 90/311 dead transitions. [2025-03-17 06:19:46,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 311 transitions, 6335 flow [2025-03-17 06:19:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 06:19:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 06:19:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 367 transitions. [2025-03-17 06:19:46,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5097222222222222 [2025-03-17 06:19:46,702 INFO L175 Difference]: Start difference. First operand has 163 places, 116 transitions, 1998 flow. Second operand 30 states and 367 transitions. [2025-03-17 06:19:46,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 311 transitions, 6335 flow [2025-03-17 06:19:46,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 311 transitions, 4623 flow, removed 832 selfloop flow, removed 22 redundant places. [2025-03-17 06:19:46,912 INFO L231 Difference]: Finished difference. Result has 173 places, 139 transitions, 2264 flow [2025-03-17 06:19:46,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2264, PETRI_PLACES=173, PETRI_TRANSITIONS=139} [2025-03-17 06:19:46,913 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 147 predicate places. [2025-03-17 06:19:46,913 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 139 transitions, 2264 flow [2025-03-17 06:19:46,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.05) internal successors, (141), 20 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:46,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:46,913 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:46,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:19:47,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:19:47,114 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:47,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1611224399, now seen corresponding path program 4 times [2025-03-17 06:19:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:47,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050239975] [2025-03-17 06:19:47,115 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:19:47,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:47,119 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-17 06:19:47,123 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:19:47,123 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:19:47,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:19:47,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050239975] [2025-03-17 06:19:47,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050239975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:19:47,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716097601] [2025-03-17 06:19:47,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:19:47,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:19:47,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:19:47,254 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:19:47,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 06:19:47,290 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-17 06:19:47,301 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:19:47,302 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:19:47,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:19:47,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 06:19:47,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:19:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:47,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:19:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:19:47,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716097601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:19:47,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:19:47,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 16 [2025-03-17 06:19:47,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860231466] [2025-03-17 06:19:47,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:19:47,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:19:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:19:47,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:19:47,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:19:47,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-17 06:19:47,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 139 transitions, 2264 flow. Second operand has 17 states, 17 states have (on average 6.823529411764706) internal successors, (116), 17 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:47,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:19:47,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-17 06:19:47,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:19:48,195 INFO L124 PetriNetUnfolderBase]: 1498/2927 cut-off events. [2025-03-17 06:19:48,195 INFO L125 PetriNetUnfolderBase]: For 151657/151657 co-relation queries the response was YES. [2025-03-17 06:19:48,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19788 conditions, 2927 events. 1498/2927 cut-off events. For 151657/151657 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 16284 event pairs, 95 based on Foata normal form. 18/2940 useless extension candidates. Maximal degree in co-relation 19711. Up to 564 conditions per place. [2025-03-17 06:19:48,214 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 103 selfloop transitions, 106 changer transitions 47/259 dead transitions. [2025-03-17 06:19:48,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 259 transitions, 4453 flow [2025-03-17 06:19:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 06:19:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 06:19:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 269 transitions. [2025-03-17 06:19:48,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509469696969697 [2025-03-17 06:19:48,215 INFO L175 Difference]: Start difference. First operand has 173 places, 139 transitions, 2264 flow. Second operand 22 states and 269 transitions. [2025-03-17 06:19:48,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 259 transitions, 4453 flow [2025-03-17 06:19:48,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 259 transitions, 3980 flow, removed 221 selfloop flow, removed 12 redundant places. [2025-03-17 06:19:48,393 INFO L231 Difference]: Finished difference. Result has 180 places, 143 transitions, 2326 flow [2025-03-17 06:19:48,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2326, PETRI_PLACES=180, PETRI_TRANSITIONS=143} [2025-03-17 06:19:48,393 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 154 predicate places. [2025-03-17 06:19:48,394 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 143 transitions, 2326 flow [2025-03-17 06:19:48,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.823529411764706) internal successors, (116), 17 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:19:48,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:19:48,394 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:19:48,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:19:48,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 06:19:48,594 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-17 06:19:48,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:19:48,595 INFO L85 PathProgramCache]: Analyzing trace with hash -51349366, now seen corresponding path program 5 times [2025-03-17 06:19:48,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:19:48,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489722451] [2025-03-17 06:19:48,595 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:19:48,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:19:48,599 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 5 equivalence classes. [2025-03-17 06:19:48,603 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 06:19:48,603 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 06:19:48,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:19:48,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:19:48,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 06:19:48,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 06:19:48,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:19:48,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:19:48,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:19:48,626 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:19:48,627 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-17 06:19:48,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-17 06:19:48,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-17 06:19:48,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:19:48,629 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1, 1] [2025-03-17 06:19:48,685 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 06:19:48,685 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:19:48,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:19:48 BasicIcfg [2025-03-17 06:19:48,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:19:48,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:19:48,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:19:48,691 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:19:48,692 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:19:38" (3/4) ... [2025-03-17 06:19:48,693 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 06:19:48,733 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-03-17 06:19:48,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 06:19:48,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 06:19:48,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:19:48,774 INFO L158 Benchmark]: Toolchain (without parser) took 10789.17ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 131.4MB in the beginning and 144.2MB in the end (delta: -12.7MB). Peak memory consumption was 207.2MB. Max. memory is 16.1GB. [2025-03-17 06:19:48,775 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:19:48,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.02ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 112.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:19:48,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.33ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 110.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:19:48,776 INFO L158 Benchmark]: Boogie Preprocessor took 26.46ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:19:48,776 INFO L158 Benchmark]: IcfgBuilder took 323.22ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 91.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:19:48,777 INFO L158 Benchmark]: TraceAbstraction took 10038.35ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 90.6MB in the beginning and 157.6MB in the end (delta: -67.0MB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. [2025-03-17 06:19:48,777 INFO L158 Benchmark]: Witness Printer took 80.57ms. Allocated memory is still 385.9MB. Free memory was 157.6MB in the beginning and 144.2MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:19:48,778 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.23ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.02ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 112.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.33ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 110.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.46ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 323.22ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 91.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10038.35ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 90.6MB in the beginning and 157.6MB in the end (delta: -67.0MB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. * Witness Printer took 80.57ms. Allocated memory is still 385.9MB. Free memory was 157.6MB in the beginning and 144.2MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=2, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=7, id1=2, id2=3, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=13, id1=2, id2=3, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=2, id2=3, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=2, id2=3, j=16, k=4, k=4] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=2, id2=3, j=16, k=4, k=4] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 36 edges, 3 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: 9.9s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2211 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2204 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3365 IncrementalHoareTripleChecker+Invalid, 3504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 3 mSDtfsCounter, 3365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 216 SyntacticMatches, 8 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2326occurred in iteration=13, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 472 ConstructedInterpolants, 0 QuantifiedInterpolants, 1833 SizeOfPredicates, 32 NumberOfNonLiveVariables, 505 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 0/177 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 proved your program to be incorrect! [2025-03-17 06:19:48,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE