./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:09:56,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:09:56,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:09:56,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:09:56,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:09:56,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:09:56,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:09:56,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:09:56,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:09:56,999 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:09:57,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:09:57,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:09:57,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:09:57,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:09:57,003 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:09:57,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:09:57,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:09:57,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:09:57,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:09:57,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:09:57,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:09:57,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:09:57,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:09:57,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:09:57,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:09:57,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:09:57,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:09:57,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:09:57,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:09:57,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:09:57,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:09:57,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:09:57,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:09:57,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:09:57,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:09:57,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:09:57,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:09:57,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:09:57,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:09:57,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:09:57,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:09:57,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:09:57,010 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 [2024-10-11 14:09:57,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:09:57,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:09:57,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:09:57,293 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:09:57,293 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:09:57,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2024-10-11 14:09:58,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:09:58,977 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:09:58,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2024-10-11 14:09:58,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a8970b1c/e5cb8eb205d64f09bc36385ddbd122ee/FLAGe3027f365 [2024-10-11 14:09:59,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a8970b1c/e5cb8eb205d64f09bc36385ddbd122ee [2024-10-11 14:09:59,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:09:59,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:09:59,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:09:59,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:09:59,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:09:59,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a83c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59, skipping insertion in model container [2024-10-11 14:09:59,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:09:59,394 WARN L248 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-longer-2.i[30963,30976] [2024-10-11 14:09:59,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:09:59,408 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:09:59,465 WARN L248 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-longer-2.i[30963,30976] [2024-10-11 14:09:59,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:09:59,504 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:09:59,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59 WrapperNode [2024-10-11 14:09:59,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:09:59,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:09:59,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:09:59,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:09:59,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,553 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-10-11 14:09:59,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:09:59,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:09:59,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:09:59,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:09:59,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,584 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]. [2024-10-11 14:09:59,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:09:59,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:09:59,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:09:59,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:09:59,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (1/1) ... [2024-10-11 14:09:59,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:09:59,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:59,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:09:59,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:09:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 14:09:59,709 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 14:09:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 14:09:59,709 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 14:09:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:09:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:09:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:09:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:09:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:09:59,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:09:59,712 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:09:59,811 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:09:59,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:09:59,921 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:09:59,921 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:10:00,035 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:10:00,036 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 14:10:00,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:10:00 BoogieIcfgContainer [2024-10-11 14:10:00,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:10:00,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:10:00,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:10:00,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:10:00,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:09:59" (1/3) ... [2024-10-11 14:10:00,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0e868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:10:00, skipping insertion in model container [2024-10-11 14:10:00,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:59" (2/3) ... [2024-10-11 14:10:00,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0e868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:10:00, skipping insertion in model container [2024-10-11 14:10:00,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:10:00" (3/3) ... [2024-10-11 14:10:00,043 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2024-10-11 14:10:00,061 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:10:00,062 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:10:00,062 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:10:00,096 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:10:00,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2024-10-11 14:10:00,148 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-10-11 14:10:00,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:10:00,153 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 4. Compared 30 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. [2024-10-11 14:10:00,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2024-10-11 14:10:00,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2024-10-11 14:10:00,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:10:00,172 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;@44f858a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:10:00,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 14:10:00,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:10:00,185 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-10-11 14:10:00,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:10:00,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:00,186 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:00,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:00,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:00,195 INFO L85 PathProgramCache]: Analyzing trace with hash 762204344, now seen corresponding path program 1 times [2024-10-11 14:10:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:00,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636281038] [2024-10-11 14:10:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:00,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:00,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636281038] [2024-10-11 14:10:00,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636281038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:00,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:10:00,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85574083] [2024-10-11 14:10:00,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:00,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:10:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:00,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:10:00,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:10:00,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:00,838 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) [2024-10-11 14:10:00,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:00,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:00,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:01,143 INFO L124 PetriNetUnfolderBase]: 385/647 cut-off events. [2024-10-11 14:10:01,144 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 14:10:01,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 647 events. 385/647 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2667 event pairs, 57 based on Foata normal form. 15/646 useless extension candidates. Maximal degree in co-relation 1251. Up to 303 conditions per place. [2024-10-11 14:10:01,150 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 29 selfloop transitions, 7 changer transitions 31/70 dead transitions. [2024-10-11 14:10:01,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 70 transitions, 283 flow [2024-10-11 14:10:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:10:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:10:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-10-11 14:10:01,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578125 [2024-10-11 14:10:01,162 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 8 states and 111 transitions. [2024-10-11 14:10:01,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 70 transitions, 283 flow [2024-10-11 14:10:01,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 70 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:10:01,167 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 97 flow [2024-10-11 14:10:01,170 INFO L260 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=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=97, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2024-10-11 14:10:01,173 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2024-10-11 14:10:01,173 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 97 flow [2024-10-11 14:10:01,174 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) [2024-10-11 14:10:01,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:01,175 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:01,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:10:01,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:01,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:01,177 INFO L85 PathProgramCache]: Analyzing trace with hash -517073457, now seen corresponding path program 1 times [2024-10-11 14:10:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955301126] [2024-10-11 14:10:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:01,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:01,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:01,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955301126] [2024-10-11 14:10:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955301126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:01,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:01,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:10:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048380328] [2024-10-11 14:10:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:01,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:10:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:01,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:10:01,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:10:01,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:01,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 97 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) [2024-10-11 14:10:01,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:01,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:01,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:01,547 INFO L124 PetriNetUnfolderBase]: 247/446 cut-off events. [2024-10-11 14:10:01,548 INFO L125 PetriNetUnfolderBase]: For 416/422 co-relation queries the response was YES. [2024-10-11 14:10:01,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 446 events. 247/446 cut-off events. For 416/422 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1792 event pairs, 63 based on Foata normal form. 24/467 useless extension candidates. Maximal degree in co-relation 1158. Up to 190 conditions per place. [2024-10-11 14:10:01,571 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 27 selfloop transitions, 8 changer transitions 15/53 dead transitions. [2024-10-11 14:10:01,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 291 flow [2024-10-11 14:10:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:10:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:10:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2024-10-11 14:10:01,574 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-10-11 14:10:01,574 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 97 flow. Second operand 6 states and 76 transitions. [2024-10-11 14:10:01,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 291 flow [2024-10-11 14:10:01,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 287 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 14:10:01,583 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 141 flow [2024-10-11 14:10:01,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-10-11 14:10:01,584 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2024-10-11 14:10:01,585 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 141 flow [2024-10-11 14:10:01,585 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) [2024-10-11 14:10:01,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:01,586 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:01,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:10:01,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:01,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:01,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1754207660, now seen corresponding path program 1 times [2024-10-11 14:10:01,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:01,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898501499] [2024-10-11 14:10:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:01,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:01,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898501499] [2024-10-11 14:10:01,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898501499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:01,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:01,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:10:01,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098572102] [2024-10-11 14:10:01,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:01,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:10:01,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:01,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:10:01,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:10:01,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:01,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 141 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) [2024-10-11 14:10:01,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:01,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:01,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:01,992 INFO L124 PetriNetUnfolderBase]: 391/713 cut-off events. [2024-10-11 14:10:01,993 INFO L125 PetriNetUnfolderBase]: For 1184/1190 co-relation queries the response was YES. [2024-10-11 14:10:01,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 713 events. 391/713 cut-off events. For 1184/1190 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3059 event pairs, 89 based on Foata normal form. 33/745 useless extension candidates. Maximal degree in co-relation 2098. Up to 264 conditions per place. [2024-10-11 14:10:01,999 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 47 selfloop transitions, 11 changer transitions 20/81 dead transitions. [2024-10-11 14:10:02,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 81 transitions, 515 flow [2024-10-11 14:10:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:10:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:10:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-10-11 14:10:02,003 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-10-11 14:10:02,004 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 141 flow. Second operand 9 states and 117 transitions. [2024-10-11 14:10:02,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 81 transitions, 515 flow [2024-10-11 14:10:02,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 81 transitions, 473 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-10-11 14:10:02,012 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 237 flow [2024-10-11 14:10:02,012 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2024-10-11 14:10:02,013 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2024-10-11 14:10:02,013 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 237 flow [2024-10-11 14:10:02,014 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) [2024-10-11 14:10:02,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:02,014 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:02,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:10:02,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:02,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2024183696, now seen corresponding path program 2 times [2024-10-11 14:10:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:02,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641970472] [2024-10-11 14:10:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:02,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:02,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:02,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641970472] [2024-10-11 14:10:02,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641970472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:02,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:02,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:10:02,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663851723] [2024-10-11 14:10:02,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:02,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:10:02,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:02,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:10:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:10:02,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:02,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 237 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) [2024-10-11 14:10:02,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:02,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:02,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:02,327 INFO L124 PetriNetUnfolderBase]: 328/608 cut-off events. [2024-10-11 14:10:02,327 INFO L125 PetriNetUnfolderBase]: For 1943/1949 co-relation queries the response was YES. [2024-10-11 14:10:02,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 608 events. 328/608 cut-off events. For 1943/1949 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2541 event pairs, 89 based on Foata normal form. 51/658 useless extension candidates. Maximal degree in co-relation 2020. Up to 234 conditions per place. [2024-10-11 14:10:02,331 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 11 changer transitions 28/80 dead transitions. [2024-10-11 14:10:02,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 80 transitions, 609 flow [2024-10-11 14:10:02,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:10:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:10:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-10-11 14:10:02,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-10-11 14:10:02,333 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 237 flow. Second operand 8 states and 103 transitions. [2024-10-11 14:10:02,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 80 transitions, 609 flow [2024-10-11 14:10:02,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 80 transitions, 565 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-10-11 14:10:02,339 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 268 flow [2024-10-11 14:10:02,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2024-10-11 14:10:02,339 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2024-10-11 14:10:02,340 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 268 flow [2024-10-11 14:10:02,340 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) [2024-10-11 14:10:02,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:02,340 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:02,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:10:02,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:02,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:02,341 INFO L85 PathProgramCache]: Analyzing trace with hash 134530067, now seen corresponding path program 1 times [2024-10-11 14:10:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738022369] [2024-10-11 14:10:02,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:02,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:02,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738022369] [2024-10-11 14:10:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738022369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:02,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:02,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:10:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628575764] [2024-10-11 14:10:02,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:02,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:10:02,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:10:02,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:10:02,508 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:02,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 268 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) [2024-10-11 14:10:02,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:02,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:02,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:02,743 INFO L124 PetriNetUnfolderBase]: 463/851 cut-off events. [2024-10-11 14:10:02,743 INFO L125 PetriNetUnfolderBase]: For 4064/4070 co-relation queries the response was YES. [2024-10-11 14:10:02,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 851 events. 463/851 cut-off events. For 4064/4070 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3751 event pairs, 65 based on Foata normal form. 33/881 useless extension candidates. Maximal degree in co-relation 3135. Up to 181 conditions per place. [2024-10-11 14:10:02,750 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 54 selfloop transitions, 20 changer transitions 23/100 dead transitions. [2024-10-11 14:10:02,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 100 transitions, 818 flow [2024-10-11 14:10:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:10:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 14:10:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-10-11 14:10:02,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2024-10-11 14:10:02,753 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 268 flow. Second operand 11 states and 141 transitions. [2024-10-11 14:10:02,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 100 transitions, 818 flow [2024-10-11 14:10:02,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 100 transitions, 723 flow, removed 38 selfloop flow, removed 7 redundant places. [2024-10-11 14:10:02,763 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 378 flow [2024-10-11 14:10:02,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=378, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2024-10-11 14:10:02,765 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 37 predicate places. [2024-10-11 14:10:02,765 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 378 flow [2024-10-11 14:10:02,767 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) [2024-10-11 14:10:02,767 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:02,767 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:02,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:10:02,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:02,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1091700605, now seen corresponding path program 2 times [2024-10-11 14:10:02,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:02,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070895697] [2024-10-11 14:10:02,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:02,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:02,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070895697] [2024-10-11 14:10:02,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070895697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:02,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:02,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:10:02,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761933928] [2024-10-11 14:10:02,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:02,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:10:02,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:02,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:10:02,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:10:02,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:02,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 378 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) [2024-10-11 14:10:02,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:02,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:02,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:03,168 INFO L124 PetriNetUnfolderBase]: 400/749 cut-off events. [2024-10-11 14:10:03,168 INFO L125 PetriNetUnfolderBase]: For 5302/5308 co-relation queries the response was YES. [2024-10-11 14:10:03,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 749 events. 400/749 cut-off events. For 5302/5308 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3284 event pairs, 65 based on Foata normal form. 51/797 useless extension candidates. Maximal degree in co-relation 3003. Up to 151 conditions per place. [2024-10-11 14:10:03,174 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 41 selfloop transitions, 20 changer transitions 31/95 dead transitions. [2024-10-11 14:10:03,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 902 flow [2024-10-11 14:10:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:10:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 14:10:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-10-11 14:10:03,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-10-11 14:10:03,175 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 378 flow. Second operand 10 states and 125 transitions. [2024-10-11 14:10:03,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 902 flow [2024-10-11 14:10:03,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 793 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-10-11 14:10:03,186 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 398 flow [2024-10-11 14:10:03,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=398, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2024-10-11 14:10:03,189 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 42 predicate places. [2024-10-11 14:10:03,189 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 398 flow [2024-10-11 14:10:03,189 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) [2024-10-11 14:10:03,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:03,190 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:03,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:10:03,190 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:03,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1063992253, now seen corresponding path program 3 times [2024-10-11 14:10:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:03,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51980971] [2024-10-11 14:10:03,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:03,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:03,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51980971] [2024-10-11 14:10:03,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51980971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:10:03,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:10:03,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:10:03,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4494681] [2024-10-11 14:10:03,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:10:03,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:10:03,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:03,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:10:03,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:10:03,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:03,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 398 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) [2024-10-11 14:10:03,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:03,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:03,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:03,573 INFO L124 PetriNetUnfolderBase]: 409/755 cut-off events. [2024-10-11 14:10:03,574 INFO L125 PetriNetUnfolderBase]: For 5090/5096 co-relation queries the response was YES. [2024-10-11 14:10:03,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 755 events. 409/755 cut-off events. For 5090/5096 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3374 event pairs, 116 based on Foata normal form. 24/778 useless extension candidates. Maximal degree in co-relation 3028. Up to 363 conditions per place. [2024-10-11 14:10:03,580 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 52 selfloop transitions, 16 changer transitions 25/96 dead transitions. [2024-10-11 14:10:03,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 882 flow [2024-10-11 14:10:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:10:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 14:10:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-10-11 14:10:03,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2024-10-11 14:10:03,582 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 398 flow. Second operand 11 states and 135 transitions. [2024-10-11 14:10:03,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 882 flow [2024-10-11 14:10:03,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 798 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-10-11 14:10:03,596 INFO L231 Difference]: Finished difference. Result has 71 places, 46 transitions, 433 flow [2024-10-11 14:10:03,596 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=433, PETRI_PLACES=71, PETRI_TRANSITIONS=46} [2024-10-11 14:10:03,598 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 45 predicate places. [2024-10-11 14:10:03,598 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 46 transitions, 433 flow [2024-10-11 14:10:03,599 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) [2024-10-11 14:10:03,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:03,599 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:03,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:10:03,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:03,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:03,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1423899474, now seen corresponding path program 1 times [2024-10-11 14:10:03,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:03,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688392371] [2024-10-11 14:10:03,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:03,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:03,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:03,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688392371] [2024-10-11 14:10:03,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688392371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:03,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715589204] [2024-10-11 14:10:03,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:03,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:03,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:03,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:03,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:10:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:03,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 14:10:03,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:03,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715589204] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:04,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:04,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 14:10:04,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363147858] [2024-10-11 14:10:04,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:04,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:10:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:04,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:10:04,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:10:04,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:04,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 46 transitions, 433 flow. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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) [2024-10-11 14:10:04,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:04,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:04,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:04,553 INFO L124 PetriNetUnfolderBase]: 643/1166 cut-off events. [2024-10-11 14:10:04,553 INFO L125 PetriNetUnfolderBase]: For 9744/9750 co-relation queries the response was YES. [2024-10-11 14:10:04,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4981 conditions, 1166 events. 643/1166 cut-off events. For 9744/9750 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5061 event pairs, 59 based on Foata normal form. 51/1214 useless extension candidates. Maximal degree in co-relation 4944. Up to 207 conditions per place. [2024-10-11 14:10:04,562 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 66 selfloop transitions, 35 changer transitions 56/160 dead transitions. [2024-10-11 14:10:04,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 160 transitions, 1559 flow [2024-10-11 14:10:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 14:10:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 14:10:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 236 transitions. [2024-10-11 14:10:04,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2024-10-11 14:10:04,569 INFO L175 Difference]: Start difference. First operand has 71 places, 46 transitions, 433 flow. Second operand 19 states and 236 transitions. [2024-10-11 14:10:04,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 160 transitions, 1559 flow [2024-10-11 14:10:04,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 160 transitions, 1482 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-10-11 14:10:04,587 INFO L231 Difference]: Finished difference. Result has 90 places, 62 transitions, 781 flow [2024-10-11 14:10:04,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=781, PETRI_PLACES=90, PETRI_TRANSITIONS=62} [2024-10-11 14:10:04,589 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2024-10-11 14:10:04,591 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 62 transitions, 781 flow [2024-10-11 14:10:04,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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) [2024-10-11 14:10:04,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:04,591 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:04,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:10:04,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:04,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:04,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1514895422, now seen corresponding path program 1 times [2024-10-11 14:10:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:04,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313473632] [2024-10-11 14:10:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:04,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:04,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:04,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313473632] [2024-10-11 14:10:04,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313473632] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:04,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600486525] [2024-10-11 14:10:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:04,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:04,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:04,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:04,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:10:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:05,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 14:10:05,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:05,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:05,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600486525] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:05,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:05,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-11 14:10:05,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071713999] [2024-10-11 14:10:05,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:05,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 14:10:05,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:05,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 14:10:05,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-11 14:10:05,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:05,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 62 transitions, 781 flow. Second operand has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:10:05,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:05,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:05,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:06,072 INFO L124 PetriNetUnfolderBase]: 841/1577 cut-off events. [2024-10-11 14:10:06,073 INFO L125 PetriNetUnfolderBase]: For 23238/23244 co-relation queries the response was YES. [2024-10-11 14:10:06,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7809 conditions, 1577 events. 841/1577 cut-off events. For 23238/23244 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6922 event pairs, 215 based on Foata normal form. 87/1663 useless extension candidates. Maximal degree in co-relation 7765. Up to 756 conditions per place. [2024-10-11 14:10:06,084 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 95 selfloop transitions, 25 changer transitions 89/212 dead transitions. [2024-10-11 14:10:06,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 212 transitions, 2565 flow [2024-10-11 14:10:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 14:10:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-10-11 14:10:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 301 transitions. [2024-10-11 14:10:06,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5016666666666667 [2024-10-11 14:10:06,087 INFO L175 Difference]: Start difference. First operand has 90 places, 62 transitions, 781 flow. Second operand 25 states and 301 transitions. [2024-10-11 14:10:06,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 212 transitions, 2565 flow [2024-10-11 14:10:06,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 212 transitions, 2040 flow, removed 249 selfloop flow, removed 10 redundant places. [2024-10-11 14:10:06,125 INFO L231 Difference]: Finished difference. Result has 118 places, 76 transitions, 882 flow [2024-10-11 14:10:06,125 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=882, PETRI_PLACES=118, PETRI_TRANSITIONS=76} [2024-10-11 14:10:06,125 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 92 predicate places. [2024-10-11 14:10:06,126 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 76 transitions, 882 flow [2024-10-11 14:10:06,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:10:06,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:06,126 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:06,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:10:06,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:06,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:06,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2021366800, now seen corresponding path program 2 times [2024-10-11 14:10:06,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:06,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681311191] [2024-10-11 14:10:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:06,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:06,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681311191] [2024-10-11 14:10:06,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681311191] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:06,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153412348] [2024-10-11 14:10:06,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:10:06,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:06,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:06,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:06,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:10:06,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:10:06,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:06,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 14:10:06,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:06,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:06,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153412348] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:06,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:06,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-11 14:10:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914484385] [2024-10-11 14:10:06,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:06,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 14:10:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:06,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 14:10:06,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-10-11 14:10:06,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:06,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 76 transitions, 882 flow. Second operand has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:10:06,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:06,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:06,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:07,782 INFO L124 PetriNetUnfolderBase]: 1435/2711 cut-off events. [2024-10-11 14:10:07,782 INFO L125 PetriNetUnfolderBase]: For 73809/73815 co-relation queries the response was YES. [2024-10-11 14:10:07,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15196 conditions, 2711 events. 1435/2711 cut-off events. For 73809/73815 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14454 event pairs, 136 based on Foata normal form. 87/2797 useless extension candidates. Maximal degree in co-relation 15139. Up to 501 conditions per place. [2024-10-11 14:10:07,808 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 127 selfloop transitions, 80 changer transitions 91/301 dead transitions. [2024-10-11 14:10:07,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 301 transitions, 4066 flow [2024-10-11 14:10:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 14:10:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-10-11 14:10:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 393 transitions. [2024-10-11 14:10:07,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.51171875 [2024-10-11 14:10:07,812 INFO L175 Difference]: Start difference. First operand has 118 places, 76 transitions, 882 flow. Second operand 32 states and 393 transitions. [2024-10-11 14:10:07,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 301 transitions, 4066 flow [2024-10-11 14:10:07,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 301 transitions, 3452 flow, removed 299 selfloop flow, removed 13 redundant places. [2024-10-11 14:10:07,891 INFO L231 Difference]: Finished difference. Result has 150 places, 119 transitions, 1713 flow [2024-10-11 14:10:07,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1713, PETRI_PLACES=150, PETRI_TRANSITIONS=119} [2024-10-11 14:10:07,891 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 124 predicate places. [2024-10-11 14:10:07,891 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 119 transitions, 1713 flow [2024-10-11 14:10:07,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:10:07,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:07,892 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:07,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 14:10:08,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:08,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:08,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:08,093 INFO L85 PathProgramCache]: Analyzing trace with hash -983284332, now seen corresponding path program 3 times [2024-10-11 14:10:08,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:08,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026204695] [2024-10-11 14:10:08,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:08,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:08,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026204695] [2024-10-11 14:10:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026204695] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:08,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252053651] [2024-10-11 14:10:08,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:10:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:08,254 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:08,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 14:10:08,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 14:10:08,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:08,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 14:10:08,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:08,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:08,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252053651] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:08,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:08,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-11 14:10:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840368640] [2024-10-11 14:10:08,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:08,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 14:10:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:08,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 14:10:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:10:08,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:08,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 119 transitions, 1713 flow. Second operand has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:10:08,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:08,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:08,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:09,964 INFO L124 PetriNetUnfolderBase]: 1822/3429 cut-off events. [2024-10-11 14:10:09,964 INFO L125 PetriNetUnfolderBase]: For 164399/164405 co-relation queries the response was YES. [2024-10-11 14:10:09,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22480 conditions, 3429 events. 1822/3429 cut-off events. For 164399/164405 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 19256 event pairs, 58 based on Foata normal form. 123/3551 useless extension candidates. Maximal degree in co-relation 22408. Up to 657 conditions per place. [2024-10-11 14:10:10,003 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 124 selfloop transitions, 121 changer transitions 115/363 dead transitions. [2024-10-11 14:10:10,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 363 transitions, 6090 flow [2024-10-11 14:10:10,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 14:10:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-10-11 14:10:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 443 transitions. [2024-10-11 14:10:10,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5127314814814815 [2024-10-11 14:10:10,007 INFO L175 Difference]: Start difference. First operand has 150 places, 119 transitions, 1713 flow. Second operand 36 states and 443 transitions. [2024-10-11 14:10:10,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 363 transitions, 6090 flow [2024-10-11 14:10:10,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 363 transitions, 5182 flow, removed 440 selfloop flow, removed 16 redundant places. [2024-10-11 14:10:10,277 INFO L231 Difference]: Finished difference. Result has 183 places, 154 transitions, 2571 flow [2024-10-11 14:10:10,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2571, PETRI_PLACES=183, PETRI_TRANSITIONS=154} [2024-10-11 14:10:10,278 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 157 predicate places. [2024-10-11 14:10:10,278 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 154 transitions, 2571 flow [2024-10-11 14:10:10,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:10:10,278 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:10,278 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:10,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 14:10:10,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 14:10:10,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:10,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2083707491, now seen corresponding path program 4 times [2024-10-11 14:10:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:10,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431304833] [2024-10-11 14:10:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:10,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:10,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431304833] [2024-10-11 14:10:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431304833] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:10,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346569837] [2024-10-11 14:10:10,738 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 14:10:10,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:10,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:10,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:10,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 14:10:10,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 14:10:10,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:10,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 14:10:10,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:10,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:11,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346569837] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:11,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-10-11 14:10:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236029653] [2024-10-11 14:10:11,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:11,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 14:10:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 14:10:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2024-10-11 14:10:11,174 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:11,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 154 transitions, 2571 flow. Second operand has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 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) [2024-10-11 14:10:11,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:11,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:11,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:13,108 INFO L124 PetriNetUnfolderBase]: 2632/4896 cut-off events. [2024-10-11 14:10:13,109 INFO L125 PetriNetUnfolderBase]: For 356048/356054 co-relation queries the response was YES. [2024-10-11 14:10:13,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38206 conditions, 4896 events. 2632/4896 cut-off events. For 356048/356054 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 26536 event pairs, 89 based on Foata normal form. 105/4998 useless extension candidates. Maximal degree in co-relation 38120. Up to 975 conditions per place. [2024-10-11 14:10:13,165 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 164 selfloop transitions, 176 changer transitions 146/489 dead transitions. [2024-10-11 14:10:13,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 489 transitions, 10254 flow [2024-10-11 14:10:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-11 14:10:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2024-10-11 14:10:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 602 transitions. [2024-10-11 14:10:13,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-10-11 14:10:13,169 INFO L175 Difference]: Start difference. First operand has 183 places, 154 transitions, 2571 flow. Second operand 49 states and 602 transitions. [2024-10-11 14:10:13,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 489 transitions, 10254 flow [2024-10-11 14:10:13,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 489 transitions, 8546 flow, removed 824 selfloop flow, removed 20 redundant places. [2024-10-11 14:10:13,576 INFO L231 Difference]: Finished difference. Result has 233 places, 215 transitions, 4157 flow [2024-10-11 14:10:13,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=4157, PETRI_PLACES=233, PETRI_TRANSITIONS=215} [2024-10-11 14:10:13,577 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 207 predicate places. [2024-10-11 14:10:13,578 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 215 transitions, 4157 flow [2024-10-11 14:10:13,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 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) [2024-10-11 14:10:13,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:13,578 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:13,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 14:10:13,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 14:10:13,779 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:13,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1465053042, now seen corresponding path program 5 times [2024-10-11 14:10:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:13,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103042810] [2024-10-11 14:10:13,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:13,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:14,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:14,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103042810] [2024-10-11 14:10:14,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103042810] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:14,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025086191] [2024-10-11 14:10:14,292 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 14:10:14,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:14,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:14,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:14,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 14:10:14,351 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-10-11 14:10:14,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:14,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 14:10:14,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:14,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025086191] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:15,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:15,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-10-11 14:10:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070543107] [2024-10-11 14:10:15,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:15,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 14:10:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 14:10:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 14:10:15,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:15,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 215 transitions, 4157 flow. Second operand has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 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) [2024-10-11 14:10:15,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:15,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:15,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:16,804 INFO L124 PetriNetUnfolderBase]: 2704/5162 cut-off events. [2024-10-11 14:10:16,805 INFO L125 PetriNetUnfolderBase]: For 548902/548908 co-relation queries the response was YES. [2024-10-11 14:10:16,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43935 conditions, 5162 events. 2704/5162 cut-off events. For 548902/548908 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 29002 event pairs, 1013 based on Foata normal form. 69/5230 useless extension candidates. Maximal degree in co-relation 43827. Up to 3618 conditions per place. [2024-10-11 14:10:16,854 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 261 selfloop transitions, 45 changer transitions 95/404 dead transitions. [2024-10-11 14:10:16,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 404 transitions, 9623 flow [2024-10-11 14:10:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 14:10:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-10-11 14:10:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 385 transitions. [2024-10-11 14:10:16,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-10-11 14:10:16,856 INFO L175 Difference]: Start difference. First operand has 233 places, 215 transitions, 4157 flow. Second operand 33 states and 385 transitions. [2024-10-11 14:10:16,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 404 transitions, 9623 flow [2024-10-11 14:10:17,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 404 transitions, 7126 flow, removed 1227 selfloop flow, removed 17 redundant places. [2024-10-11 14:10:17,698 INFO L231 Difference]: Finished difference. Result has 252 places, 231 transitions, 3701 flow [2024-10-11 14:10:17,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3046, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3701, PETRI_PLACES=252, PETRI_TRANSITIONS=231} [2024-10-11 14:10:17,699 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 226 predicate places. [2024-10-11 14:10:17,699 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 231 transitions, 3701 flow [2024-10-11 14:10:17,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 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) [2024-10-11 14:10:17,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:17,699 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:17,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 14:10:17,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 14:10:17,900 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:17,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -427535638, now seen corresponding path program 6 times [2024-10-11 14:10:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:17,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938686483] [2024-10-11 14:10:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:18,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938686483] [2024-10-11 14:10:18,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938686483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:18,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723625391] [2024-10-11 14:10:18,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 14:10:18,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:18,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:18,308 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:18,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 14:10:18,371 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-10-11 14:10:18,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:18,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 14:10:18,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:18,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723625391] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:18,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-10-11 14:10:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648699590] [2024-10-11 14:10:18,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:18,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 14:10:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:18,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 14:10:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 14:10:19,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:19,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 231 transitions, 3701 flow. Second operand has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 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) [2024-10-11 14:10:19,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:19,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:19,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:21,796 INFO L124 PetriNetUnfolderBase]: 3208/6315 cut-off events. [2024-10-11 14:10:21,796 INFO L125 PetriNetUnfolderBase]: For 534394/534400 co-relation queries the response was YES. [2024-10-11 14:10:21,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47945 conditions, 6315 events. 3208/6315 cut-off events. For 534394/534400 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 37832 event pairs, 596 based on Foata normal form. 69/6383 useless extension candidates. Maximal degree in co-relation 47832. Up to 2398 conditions per place. [2024-10-11 14:10:21,850 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 265 selfloop transitions, 165 changer transitions 135/568 dead transitions. [2024-10-11 14:10:21,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 568 transitions, 10808 flow [2024-10-11 14:10:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-11 14:10:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-10-11 14:10:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 614 transitions. [2024-10-11 14:10:21,853 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4827044025157233 [2024-10-11 14:10:21,853 INFO L175 Difference]: Start difference. First operand has 252 places, 231 transitions, 3701 flow. Second operand 53 states and 614 transitions. [2024-10-11 14:10:21,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 568 transitions, 10808 flow [2024-10-11 14:10:22,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 568 transitions, 10049 flow, removed 354 selfloop flow, removed 21 redundant places. [2024-10-11 14:10:22,880 INFO L231 Difference]: Finished difference. Result has 295 places, 287 transitions, 4983 flow [2024-10-11 14:10:22,881 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3284, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=4983, PETRI_PLACES=295, PETRI_TRANSITIONS=287} [2024-10-11 14:10:22,881 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 269 predicate places. [2024-10-11 14:10:22,881 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 287 transitions, 4983 flow [2024-10-11 14:10:22,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 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) [2024-10-11 14:10:22,882 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:22,882 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:22,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 14:10:23,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:23,083 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:23,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash 739609620, now seen corresponding path program 7 times [2024-10-11 14:10:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227554851] [2024-10-11 14:10:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:23,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227554851] [2024-10-11 14:10:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227554851] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943418249] [2024-10-11 14:10:23,526 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 14:10:23,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:23,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:23,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:23,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 14:10:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:23,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 14:10:23,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:23,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:24,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943418249] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:24,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:24,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2024-10-11 14:10:24,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952917945] [2024-10-11 14:10:24,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:24,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 14:10:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:24,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 14:10:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1446, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 14:10:24,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:24,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 287 transitions, 4983 flow. Second operand has 42 states, 42 states have (on average 7.142857142857143) internal successors, (300), 42 states have internal predecessors, (300), 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) [2024-10-11 14:10:24,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:24,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:24,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:27,501 INFO L124 PetriNetUnfolderBase]: 4099/8332 cut-off events. [2024-10-11 14:10:27,502 INFO L125 PetriNetUnfolderBase]: For 905406/905412 co-relation queries the response was YES. [2024-10-11 14:10:27,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70190 conditions, 8332 events. 4099/8332 cut-off events. For 905406/905412 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 54612 event pairs, 288 based on Foata normal form. 87/8418 useless extension candidates. Maximal degree in co-relation 70064. Up to 1947 conditions per place. [2024-10-11 14:10:27,597 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 239 selfloop transitions, 309 changer transitions 157/708 dead transitions. [2024-10-11 14:10:27,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 708 transitions, 15141 flow [2024-10-11 14:10:27,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-11 14:10:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-10-11 14:10:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 694 transitions. [2024-10-11 14:10:27,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4901129943502825 [2024-10-11 14:10:27,600 INFO L175 Difference]: Start difference. First operand has 295 places, 287 transitions, 4983 flow. Second operand 59 states and 694 transitions. [2024-10-11 14:10:27,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 708 transitions, 15141 flow [2024-10-11 14:10:29,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 708 transitions, 13664 flow, removed 640 selfloop flow, removed 29 redundant places. [2024-10-11 14:10:29,591 INFO L231 Difference]: Finished difference. Result has 340 places, 384 transitions, 7386 flow [2024-10-11 14:10:29,592 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4222, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=7386, PETRI_PLACES=340, PETRI_TRANSITIONS=384} [2024-10-11 14:10:29,592 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 314 predicate places. [2024-10-11 14:10:29,592 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 384 transitions, 7386 flow [2024-10-11 14:10:29,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.142857142857143) internal successors, (300), 42 states have internal predecessors, (300), 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) [2024-10-11 14:10:29,593 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:29,593 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:29,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 14:10:29,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 14:10:29,793 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:29,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 39792594, now seen corresponding path program 8 times [2024-10-11 14:10:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:29,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782167017] [2024-10-11 14:10:29,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:30,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:30,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782167017] [2024-10-11 14:10:30,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782167017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:30,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367207937] [2024-10-11 14:10:30,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:10:30,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:30,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:30,158 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:30,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 14:10:30,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:10:30,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:30,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 14:10:30,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:30,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:30,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367207937] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:30,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:30,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-10-11 14:10:30,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439271506] [2024-10-11 14:10:30,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:30,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 14:10:30,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:30,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 14:10:30,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1383, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 14:10:30,790 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:30,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 384 transitions, 7386 flow. Second operand has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 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) [2024-10-11 14:10:30,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:30,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:30,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:34,533 INFO L124 PetriNetUnfolderBase]: 5143/10444 cut-off events. [2024-10-11 14:10:34,533 INFO L125 PetriNetUnfolderBase]: For 1551652/1551658 co-relation queries the response was YES. [2024-10-11 14:10:34,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97699 conditions, 10444 events. 5143/10444 cut-off events. For 1551652/1551658 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 72171 event pairs, 150 based on Foata normal form. 87/10530 useless extension candidates. Maximal degree in co-relation 97556. Up to 2499 conditions per place. [2024-10-11 14:10:34,639 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 222 selfloop transitions, 422 changer transitions 157/804 dead transitions. [2024-10-11 14:10:34,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 804 transitions, 18543 flow [2024-10-11 14:10:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-11 14:10:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-10-11 14:10:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 704 transitions. [2024-10-11 14:10:34,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4971751412429379 [2024-10-11 14:10:34,642 INFO L175 Difference]: Start difference. First operand has 340 places, 384 transitions, 7386 flow. Second operand 59 states and 704 transitions. [2024-10-11 14:10:34,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 804 transitions, 18543 flow [2024-10-11 14:10:38,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 804 transitions, 15884 flow, removed 1181 selfloop flow, removed 31 redundant places. [2024-10-11 14:10:38,015 INFO L231 Difference]: Finished difference. Result has 384 places, 480 transitions, 9434 flow [2024-10-11 14:10:38,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5931, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=9434, PETRI_PLACES=384, PETRI_TRANSITIONS=480} [2024-10-11 14:10:38,016 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 358 predicate places. [2024-10-11 14:10:38,016 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 480 transitions, 9434 flow [2024-10-11 14:10:38,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 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) [2024-10-11 14:10:38,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:38,017 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:38,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 14:10:38,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:38,217 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:38,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2146966046, now seen corresponding path program 9 times [2024-10-11 14:10:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424198740] [2024-10-11 14:10:38,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:38,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:38,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:38,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424198740] [2024-10-11 14:10:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424198740] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:38,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151048232] [2024-10-11 14:10:38,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:10:38,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:38,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:38,540 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:38,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 14:10:38,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-11 14:10:38,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:38,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 14:10:38,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:38,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:39,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151048232] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:39,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:39,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2024-10-11 14:10:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915921303] [2024-10-11 14:10:39,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:39,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 14:10:39,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:39,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 14:10:39,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1407, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 14:10:39,086 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:39,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 480 transitions, 9434 flow. Second operand has 42 states, 42 states have (on average 7.142857142857143) internal successors, (300), 42 states have internal predecessors, (300), 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) [2024-10-11 14:10:39,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:39,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:39,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:43,660 INFO L124 PetriNetUnfolderBase]: 5917/11880 cut-off events. [2024-10-11 14:10:43,661 INFO L125 PetriNetUnfolderBase]: For 2030900/2030906 co-relation queries the response was YES. [2024-10-11 14:10:43,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117443 conditions, 11880 events. 5917/11880 cut-off events. For 2030900/2030906 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 83621 event pairs, 66 based on Foata normal form. 96/11975 useless extension candidates. Maximal degree in co-relation 117282. Up to 2811 conditions per place. [2024-10-11 14:10:43,797 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 215 selfloop transitions, 495 changer transitions 162/875 dead transitions. [2024-10-11 14:10:43,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 875 transitions, 21133 flow [2024-10-11 14:10:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-11 14:10:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2024-10-11 14:10:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 727 transitions. [2024-10-11 14:10:43,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5048611111111111 [2024-10-11 14:10:43,799 INFO L175 Difference]: Start difference. First operand has 384 places, 480 transitions, 9434 flow. Second operand 60 states and 727 transitions. [2024-10-11 14:10:43,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 875 transitions, 21133 flow [2024-10-11 14:10:49,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 875 transitions, 18581 flow, removed 1090 selfloop flow, removed 34 redundant places. [2024-10-11 14:10:49,043 INFO L231 Difference]: Finished difference. Result has 424 places, 540 transitions, 11119 flow [2024-10-11 14:10:49,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=7796, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=442, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=11119, PETRI_PLACES=424, PETRI_TRANSITIONS=540} [2024-10-11 14:10:49,045 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 398 predicate places. [2024-10-11 14:10:49,045 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 540 transitions, 11119 flow [2024-10-11 14:10:49,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.142857142857143) internal successors, (300), 42 states have internal predecessors, (300), 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) [2024-10-11 14:10:49,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:49,045 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:49,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 14:10:49,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 14:10:49,246 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:10:49,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:49,247 INFO L85 PathProgramCache]: Analyzing trace with hash 794305653, now seen corresponding path program 10 times [2024-10-11 14:10:49,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:49,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89339141] [2024-10-11 14:10:49,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:49,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:49,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89339141] [2024-10-11 14:10:49,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89339141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:49,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169515020] [2024-10-11 14:10:49,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 14:10:49,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:49,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:49,586 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:49,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 14:10:49,640 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 14:10:49,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:49,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 14:10:49,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:49,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:10:50,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169515020] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:50,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:50,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2024-10-11 14:10:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428599740] [2024-10-11 14:10:50,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:50,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 14:10:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:50,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 14:10:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1412, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 14:10:50,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:50,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 540 transitions, 11119 flow. Second operand has 43 states, 43 states have (on average 7.1395348837209305) internal successors, (307), 43 states have internal predecessors, (307), 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) [2024-10-11 14:10:50,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:50,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:50,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:54,502 INFO L124 PetriNetUnfolderBase]: 6052/12223 cut-off events. [2024-10-11 14:10:54,502 INFO L125 PetriNetUnfolderBase]: For 2561735/2561741 co-relation queries the response was YES. [2024-10-11 14:10:54,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127916 conditions, 12223 events. 6052/12223 cut-off events. For 2561735/2561741 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 86715 event pairs, 203 based on Foata normal form. 33/12253 useless extension candidates. Maximal degree in co-relation 127740. Up to 2865 conditions per place. [2024-10-11 14:10:55,009 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 226 selfloop transitions, 479 changer transitions 87/795 dead transitions. [2024-10-11 14:10:55,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 795 transitions, 19462 flow [2024-10-11 14:10:55,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-11 14:10:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2024-10-11 14:10:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 524 transitions. [2024-10-11 14:10:55,014 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5077519379844961 [2024-10-11 14:10:55,014 INFO L175 Difference]: Start difference. First operand has 424 places, 540 transitions, 11119 flow. Second operand 43 states and 524 transitions. [2024-10-11 14:10:55,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 795 transitions, 19462 flow [2024-10-11 14:11:01,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 795 transitions, 15997 flow, removed 1429 selfloop flow, removed 42 redundant places. [2024-10-11 14:11:01,687 INFO L231 Difference]: Finished difference. Result has 421 places, 558 transitions, 10908 flow [2024-10-11 14:11:01,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=9076, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=10908, PETRI_PLACES=421, PETRI_TRANSITIONS=558} [2024-10-11 14:11:01,688 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 395 predicate places. [2024-10-11 14:11:01,688 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 558 transitions, 10908 flow [2024-10-11 14:11:01,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 7.1395348837209305) internal successors, (307), 43 states have internal predecessors, (307), 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) [2024-10-11 14:11:01,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:01,689 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:01,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 14:11:01,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 14:11:01,890 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:11:01,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2079276827, now seen corresponding path program 11 times [2024-10-11 14:11:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:01,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218223005] [2024-10-11 14:11:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:11:02,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218223005] [2024-10-11 14:11:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218223005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:11:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754055336] [2024-10-11 14:11:02,224 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 14:11:02,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:02,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:11:02,226 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:11:02,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 14:11:02,293 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-11 14:11:02,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:11:02,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 14:11:02,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:11:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:11:02,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:11:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:11:02,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754055336] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:11:02,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:11:02,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2024-10-11 14:11:02,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730200637] [2024-10-11 14:11:02,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:11:02,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-11 14:11:02,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:02,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-11 14:11:02,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1495, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 14:11:02,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:11:02,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 558 transitions, 10908 flow. Second operand has 44 states, 44 states have (on average 7.113636363636363) internal successors, (313), 44 states have internal predecessors, (313), 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) [2024-10-11 14:11:02,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:02,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:11:02,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:07,352 INFO L124 PetriNetUnfolderBase]: 6025/12180 cut-off events. [2024-10-11 14:11:07,353 INFO L125 PetriNetUnfolderBase]: For 2007512/2007518 co-relation queries the response was YES. [2024-10-11 14:11:07,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115548 conditions, 12180 events. 6025/12180 cut-off events. For 2007512/2007518 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 86385 event pairs, 152 based on Foata normal form. 51/12230 useless extension candidates. Maximal degree in co-relation 115374. Up to 2817 conditions per place. [2024-10-11 14:11:07,541 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 212 selfloop transitions, 492 changer transitions 101/808 dead transitions. [2024-10-11 14:11:07,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 808 transitions, 17939 flow [2024-10-11 14:11:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 14:11:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-10-11 14:11:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 546 transitions. [2024-10-11 14:11:07,543 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2024-10-11 14:11:07,543 INFO L175 Difference]: Start difference. First operand has 421 places, 558 transitions, 10908 flow. Second operand 45 states and 546 transitions. [2024-10-11 14:11:07,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 808 transitions, 17939 flow [2024-10-11 14:11:13,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 808 transitions, 16312 flow, removed 658 selfloop flow, removed 24 redundant places. [2024-10-11 14:11:13,058 INFO L231 Difference]: Finished difference. Result has 444 places, 561 transitions, 11397 flow [2024-10-11 14:11:13,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=10069, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=489, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=11397, PETRI_PLACES=444, PETRI_TRANSITIONS=561} [2024-10-11 14:11:13,059 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 418 predicate places. [2024-10-11 14:11:13,059 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 561 transitions, 11397 flow [2024-10-11 14:11:13,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 7.113636363636363) internal successors, (313), 44 states have internal predecessors, (313), 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) [2024-10-11 14:11:13,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:13,060 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:13,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 14:11:13,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:13,261 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 14:11:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 656074616, now seen corresponding path program 12 times [2024-10-11 14:11:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249005580] [2024-10-11 14:11:13,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:11:13,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:11:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:11:13,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:11:13,318 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:11:13,319 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-11 14:11:13,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-11 14:11:13,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-11 14:11:13,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 14:11:13,322 INFO L407 BasicCegarLoop]: Path program histogram: [12, 3, 2, 1, 1, 1] [2024-10-11 14:11:13,473 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:11:13,476 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:11:13,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:11:13 BasicIcfg [2024-10-11 14:11:13,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:11:13,482 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:11:13,482 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:11:13,483 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:11:13,483 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:10:00" (3/4) ... [2024-10-11 14:11:13,484 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 14:11:13,579 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:11:13,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:11:13,583 INFO L158 Benchmark]: Toolchain (without parser) took 74564.26ms. Allocated memory was 151.0MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 118.5MB in the beginning and 9.5GB in the end (delta: -9.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-10-11 14:11:13,583 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:11:13,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.30ms. Allocated memory is still 151.0MB. Free memory was 118.5MB in the beginning and 97.3MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 14:11:13,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.70ms. Allocated memory is still 151.0MB. Free memory was 97.3MB in the beginning and 95.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:11:13,584 INFO L158 Benchmark]: Boogie Preprocessor took 51.99ms. Allocated memory is still 151.0MB. Free memory was 95.2MB in the beginning and 93.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:11:13,584 INFO L158 Benchmark]: RCFGBuilder took 429.49ms. Allocated memory is still 151.0MB. Free memory was 93.1MB in the beginning and 75.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 14:11:13,585 INFO L158 Benchmark]: TraceAbstraction took 73443.59ms. Allocated memory was 151.0MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 74.7MB in the beginning and 9.5GB in the end (delta: -9.5GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-10-11 14:11:13,585 INFO L158 Benchmark]: Witness Printer took 100.74ms. Allocated memory is still 11.3GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 14:11:13,586 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.48ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.30ms. Allocated memory is still 151.0MB. Free memory was 118.5MB in the beginning and 97.3MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.70ms. Allocated memory is still 151.0MB. Free memory was 97.3MB in the beginning and 95.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.99ms. Allocated memory is still 151.0MB. Free memory was 95.2MB in the beginning and 93.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 429.49ms. Allocated memory is still 151.0MB. Free memory was 93.1MB in the beginning and 75.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 73443.59ms. Allocated memory was 151.0MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 74.7MB in the beginning and 9.5GB in the end (delta: -9.5GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 100.74ms. Allocated memory is still 11.3GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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 < 10 VAL [\old(arg)={0:0}, arg={0:0}, i=3, 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=3, id1=-2, id2=-1, 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=3, j=6, k=0, k=0] [L698] 1 i = j + 1 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] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 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] [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] [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] [L704] COND TRUE 2 k < 10 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] [L704] COND TRUE 2 k < 10 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 < 10 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] [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] [L696] COND TRUE 1 k < 10 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] [L704] COND TRUE 2 k < 10 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] [L696] COND TRUE 1 k < 10 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] [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] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [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=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L716] 0 int condI = i >= (2*10 +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=23, id1=-2, id2=-1, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +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=25, id1=-2, id2=-1, j=26, k=9, k=9] [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=25, id1=-2, id2=-1, j=26, k=9, k=9] [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=25, id1=-2, id2=-1, j=26, k=9, k=9] - 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, 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: 73.2s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 59.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8138 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8115 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 439 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9068 IncrementalHoareTripleChecker+Invalid, 9507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 439 mSolverCounterUnsat, 9 mSDtfsCounter, 9068 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1851 GetRequests, 982 SyntacticMatches, 0 SemanticMatches, 869 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17971 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11397occurred in iteration=19, InterpolantAutomatonStates: 576, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1323 NumberOfCodeBlocks, 1323 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 1793 ConstructedInterpolants, 0 QuantifiedInterpolants, 8038 SizeOfPredicates, 160 NumberOfNonLiveVariables, 1678 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 43 InterpolantComputations, 7 PerfectInterpolantSequences, 60/4683 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-11 14:11:13,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE