./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c --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/weaver/bench-exp2x9.wvr.c -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 af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:25:24,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:25:24,524 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:25:24,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:25:24,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:25:24,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:25:24,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:25:24,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:25:24,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:25:24,562 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:25:24,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:25:24,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:25:24,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:25:24,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:25:24,567 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:25:24,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:25:24,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:25:24,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:25:24,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:25:24,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:25:24,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:25:24,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:25:24,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:25:24,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:25:24,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:25:24,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:25:24,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:25:24,573 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:25:24,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:25:24,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:25:24,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:25:24,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:25:24,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:25:24,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:25:24,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:25:24,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:25:24,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:25:24,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:25:24,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:25:24,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:25:24,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:25:24,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:25:24,579 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 -> af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 [2024-10-11 14:25:24,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:25:24,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:25:24,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:25:24,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:25:24,929 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:25:24,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2024-10-11 14:25:26,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:25:26,593 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:25:26,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2024-10-11 14:25:26,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/28af78d93/13be3b70c87f4b29a39ce65b338a6bf2/FLAGb7b06021d [2024-10-11 14:25:26,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/28af78d93/13be3b70c87f4b29a39ce65b338a6bf2 [2024-10-11 14:25:26,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:25:26,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:25:26,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:25:26,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:25:26,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:25:26,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:25:26" (1/1) ... [2024-10-11 14:25:26,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1025ece0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:26, skipping insertion in model container [2024-10-11 14:25:26,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:25:26" (1/1) ... [2024-10-11 14:25:27,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:25:27,231 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/weaver/bench-exp2x9.wvr.c[2721,2734] [2024-10-11 14:25:27,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:25:27,245 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:25:27,267 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/weaver/bench-exp2x9.wvr.c[2721,2734] [2024-10-11 14:25:27,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:25:27,289 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:25:27,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27 WrapperNode [2024-10-11 14:25:27,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:25:27,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:25:27,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:25:27,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:25:27,302 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:25:27" (1/1) ... [2024-10-11 14:25:27,312 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:25:27" (1/1) ... [2024-10-11 14:25:27,336 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-10-11 14:25:27,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:25:27,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:25:27,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:25:27,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:25:27,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (1/1) ... [2024-10-11 14:25:27,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (1/1) ... [2024-10-11 14:25:27,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (1/1) ... [2024-10-11 14:25:27,365 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:25:27,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (1/1) ... [2024-10-11 14:25:27,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (1/1) ... [2024-10-11 14:25:27,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (1/1) ... [2024-10-11 14:25:27,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (1/1) ... [2024-10-11 14:25:27,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (1/1) ... [2024-10-11 14:25:27,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (1/1) ... [2024-10-11 14:25:27,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:25:27,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:25:27,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:25:27,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:25:27,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (1/1) ... [2024-10-11 14:25:27,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:25:27,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:25:27,421 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:25:27,424 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:25:27,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:25:27,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 14:25:27,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 14:25:27,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 14:25:27,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 14:25:27,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 14:25:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 14:25:27,464 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-11 14:25:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-11 14:25:27,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:25:27,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:25:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:25:27,466 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:25:27,586 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:25:27,588 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:25:27,787 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:25:27,787 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:25:27,973 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:25:27,973 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 14:25:27,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:27 BoogieIcfgContainer [2024-10-11 14:25:27,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:25:27,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:25:27,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:25:27,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:25:27,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:25:26" (1/3) ... [2024-10-11 14:25:27,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3992fe82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:25:27, skipping insertion in model container [2024-10-11 14:25:27,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:27" (2/3) ... [2024-10-11 14:25:27,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3992fe82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:25:27, skipping insertion in model container [2024-10-11 14:25:27,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:27" (3/3) ... [2024-10-11 14:25:27,980 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2024-10-11 14:25:27,992 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:25:27,992 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:25:27,992 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:25:28,043 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 14:25:28,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2024-10-11 14:25:28,098 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-10-11 14:25:28,098 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 14:25:28,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 4/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-10-11 14:25:28,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2024-10-11 14:25:28,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 27 transitions, 78 flow [2024-10-11 14:25:28,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:25:28,124 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;@4c670780, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:25:28,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 14:25:28,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:25:28,144 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-10-11 14:25:28,144 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 14:25:28,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:28,145 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:28,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:28,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1825658945, now seen corresponding path program 1 times [2024-10-11 14:25:28,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:28,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033393553] [2024-10-11 14:25:28,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:28,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:28,689 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:25:28,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:28,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033393553] [2024-10-11 14:25:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033393553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:28,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:25:28,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817394040] [2024-10-11 14:25:28,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:28,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:25:28,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:28,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:25:28,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:25:28,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:28,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:25:28,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:28,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:28,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:29,060 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2024-10-11 14:25:29,061 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-10-11 14:25:29,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5555 event pairs, 123 based on Foata normal form. 1/997 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2024-10-11 14:25:29,084 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2024-10-11 14:25:29,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2024-10-11 14:25:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:25:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:25:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-10-11 14:25:29,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-10-11 14:25:29,098 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 78 flow. Second operand 3 states and 69 transitions. [2024-10-11 14:25:29,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2024-10-11 14:25:29,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 14:25:29,109 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2024-10-11 14:25:29,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2024-10-11 14:25:29,115 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-10-11 14:25:29,115 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2024-10-11 14:25:29,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:25:29,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:29,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:25:29,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:29,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:29,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1779863488, now seen corresponding path program 1 times [2024-10-11 14:25:29,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:29,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168428030] [2024-10-11 14:25:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:29,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168428030] [2024-10-11 14:25:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168428030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230568785] [2024-10-11 14:25:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:29,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:29,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:29,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:29,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:29,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:29,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:29,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:29,600 INFO L124 PetriNetUnfolderBase]: 1593/2038 cut-off events. [2024-10-11 14:25:29,600 INFO L125 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2024-10-11 14:25:29,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 2038 events. 1593/2038 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7003 event pairs, 113 based on Foata normal form. 34/2066 useless extension candidates. Maximal degree in co-relation 1272. Up to 842 conditions per place. [2024-10-11 14:25:29,616 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 66 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2024-10-11 14:25:29,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 81 transitions, 391 flow [2024-10-11 14:25:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-10-11 14:25:29,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-10-11 14:25:29,618 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 115 transitions. [2024-10-11 14:25:29,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 81 transitions, 391 flow [2024-10-11 14:25:29,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 81 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:25:29,623 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2024-10-11 14:25:29,623 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2024-10-11 14:25:29,624 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2024-10-11 14:25:29,624 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2024-10-11 14:25:29,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:29,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:29,624 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:29,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:25:29,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:29,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash -823057285, now seen corresponding path program 1 times [2024-10-11 14:25:29,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:29,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459240804] [2024-10-11 14:25:29,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:29,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:29,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459240804] [2024-10-11 14:25:29,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459240804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:29,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:29,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:29,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365134883] [2024-10-11 14:25:29,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:29,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:29,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:29,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:29,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:29,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:29,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:29,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:29,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:29,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:30,014 INFO L124 PetriNetUnfolderBase]: 1547/1992 cut-off events. [2024-10-11 14:25:30,014 INFO L125 PetriNetUnfolderBase]: For 1776/1776 co-relation queries the response was YES. [2024-10-11 14:25:30,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6028 conditions, 1992 events. 1547/1992 cut-off events. For 1776/1776 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6975 event pairs, 95 based on Foata normal form. 46/2032 useless extension candidates. Maximal degree in co-relation 2829. Up to 812 conditions per place. [2024-10-11 14:25:30,030 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 65 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2024-10-11 14:25:30,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 78 transitions, 412 flow [2024-10-11 14:25:30,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-10-11 14:25:30,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.70625 [2024-10-11 14:25:30,032 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 113 transitions. [2024-10-11 14:25:30,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 78 transitions, 412 flow [2024-10-11 14:25:30,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 78 transitions, 412 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:25:30,036 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 169 flow [2024-10-11 14:25:30,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2024-10-11 14:25:30,037 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2024-10-11 14:25:30,037 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 169 flow [2024-10-11 14:25:30,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:30,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:30,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:30,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:25:30,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:30,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash 47067324, now seen corresponding path program 2 times [2024-10-11 14:25:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:30,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351407080] [2024-10-11 14:25:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:30,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351407080] [2024-10-11 14:25:30,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351407080] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:25:30,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127949545] [2024-10-11 14:25:30,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:25:30,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:25:30,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:25:30,162 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:25:30,164 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:25:30,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:25:30,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:25:30,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 14:25:30,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:25:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:30,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:25:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:30,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127949545] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:25:30,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:25:30,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-11 14:25:30,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555998943] [2024-10-11 14:25:30,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:25:30,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:25:30,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:30,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:25:30,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:25:30,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:30,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:25:30,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:30,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:30,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:30,949 INFO L124 PetriNetUnfolderBase]: 1472/1927 cut-off events. [2024-10-11 14:25:30,949 INFO L125 PetriNetUnfolderBase]: For 2610/2610 co-relation queries the response was YES. [2024-10-11 14:25:30,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6174 conditions, 1927 events. 1472/1927 cut-off events. For 2610/2610 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7133 event pairs, 354 based on Foata normal form. 61/1970 useless extension candidates. Maximal degree in co-relation 2582. Up to 1023 conditions per place. [2024-10-11 14:25:30,965 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 65 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2024-10-11 14:25:30,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 78 transitions, 444 flow [2024-10-11 14:25:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-10-11 14:25:30,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7125 [2024-10-11 14:25:30,970 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 169 flow. Second operand 5 states and 114 transitions. [2024-10-11 14:25:30,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 78 transitions, 444 flow [2024-10-11 14:25:30,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:25:30,976 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 212 flow [2024-10-11 14:25:30,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2024-10-11 14:25:30,977 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2024-10-11 14:25:30,978 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 212 flow [2024-10-11 14:25:30,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:25:30,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:30,978 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:30,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 14:25:31,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:25:31,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:31,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:31,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2003843596, now seen corresponding path program 1 times [2024-10-11 14:25:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:31,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26144903] [2024-10-11 14:25:31,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:31,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:31,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26144903] [2024-10-11 14:25:31,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26144903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:31,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:31,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:31,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026062146] [2024-10-11 14:25:31,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:31,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:31,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:31,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:31,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:31,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:31,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:31,623 INFO L124 PetriNetUnfolderBase]: 1783/2410 cut-off events. [2024-10-11 14:25:31,624 INFO L125 PetriNetUnfolderBase]: For 6337/6337 co-relation queries the response was YES. [2024-10-11 14:25:31,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 2410 events. 1783/2410 cut-off events. For 6337/6337 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9863 event pairs, 285 based on Foata normal form. 64/2452 useless extension candidates. Maximal degree in co-relation 5382. Up to 1013 conditions per place. [2024-10-11 14:25:31,642 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2024-10-11 14:25:31,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 104 transitions, 803 flow [2024-10-11 14:25:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-10-11 14:25:31,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-10-11 14:25:31,644 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 212 flow. Second operand 5 states and 108 transitions. [2024-10-11 14:25:31,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 104 transitions, 803 flow [2024-10-11 14:25:31,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 104 transitions, 778 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-10-11 14:25:31,656 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 258 flow [2024-10-11 14:25:31,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-10-11 14:25:31,658 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2024-10-11 14:25:31,658 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 258 flow [2024-10-11 14:25:31,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:31,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:31,660 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:31,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:25:31,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:31,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2005361948, now seen corresponding path program 2 times [2024-10-11 14:25:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:31,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142510735] [2024-10-11 14:25:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142510735] [2024-10-11 14:25:31,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142510735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:31,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:31,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:31,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155795635] [2024-10-11 14:25:31,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:31,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:31,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:31,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:31,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:31,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:31,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:31,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:31,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:31,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:32,051 INFO L124 PetriNetUnfolderBase]: 1610/2155 cut-off events. [2024-10-11 14:25:32,051 INFO L125 PetriNetUnfolderBase]: For 6116/6116 co-relation queries the response was YES. [2024-10-11 14:25:32,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9020 conditions, 2155 events. 1610/2155 cut-off events. For 6116/6116 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8188 event pairs, 91 based on Foata normal form. 31/2164 useless extension candidates. Maximal degree in co-relation 5647. Up to 897 conditions per place. [2024-10-11 14:25:32,078 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 92 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2024-10-11 14:25:32,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 108 transitions, 856 flow [2024-10-11 14:25:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-10-11 14:25:32,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66875 [2024-10-11 14:25:32,080 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 258 flow. Second operand 5 states and 107 transitions. [2024-10-11 14:25:32,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 108 transitions, 856 flow [2024-10-11 14:25:32,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 856 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:25:32,090 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 319 flow [2024-10-11 14:25:32,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-10-11 14:25:32,093 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2024-10-11 14:25:32,093 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 319 flow [2024-10-11 14:25:32,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:32,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:32,094 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:32,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:25:32,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:32,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:32,095 INFO L85 PathProgramCache]: Analyzing trace with hash 595424223, now seen corresponding path program 1 times [2024-10-11 14:25:32,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:32,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889424333] [2024-10-11 14:25:32,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:32,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:32,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:32,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889424333] [2024-10-11 14:25:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889424333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:32,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:32,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:32,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55438152] [2024-10-11 14:25:32,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:32,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:32,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:32,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:32,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:32,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:32,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:32,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:32,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:32,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:32,456 INFO L124 PetriNetUnfolderBase]: 1577/2122 cut-off events. [2024-10-11 14:25:32,456 INFO L125 PetriNetUnfolderBase]: For 6970/6970 co-relation queries the response was YES. [2024-10-11 14:25:32,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9540 conditions, 2122 events. 1577/2122 cut-off events. For 6970/6970 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8181 event pairs, 71 based on Foata normal form. 33/2133 useless extension candidates. Maximal degree in co-relation 5985. Up to 983 conditions per place. [2024-10-11 14:25:32,471 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 88 selfloop transitions, 8 changer transitions 4/105 dead transitions. [2024-10-11 14:25:32,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 865 flow [2024-10-11 14:25:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-10-11 14:25:32,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-10-11 14:25:32,473 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 319 flow. Second operand 5 states and 105 transitions. [2024-10-11 14:25:32,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 865 flow [2024-10-11 14:25:32,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 854 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-10-11 14:25:32,481 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 322 flow [2024-10-11 14:25:32,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-10-11 14:25:32,481 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2024-10-11 14:25:32,481 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 322 flow [2024-10-11 14:25:32,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:32,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:32,482 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:32,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:25:32,482 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:32,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:32,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1102090329, now seen corresponding path program 2 times [2024-10-11 14:25:32,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:32,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820002941] [2024-10-11 14:25:32,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:32,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:32,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:32,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820002941] [2024-10-11 14:25:32,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820002941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:32,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:32,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:32,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588442113] [2024-10-11 14:25:32,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:32,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:32,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:32,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:32,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:32,561 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:32,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:32,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:32,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:32,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:32,842 INFO L124 PetriNetUnfolderBase]: 1515/2072 cut-off events. [2024-10-11 14:25:32,844 INFO L125 PetriNetUnfolderBase]: For 7283/7283 co-relation queries the response was YES. [2024-10-11 14:25:32,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9584 conditions, 2072 events. 1515/2072 cut-off events. For 7283/7283 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8421 event pairs, 258 based on Foata normal form. 62/2112 useless extension candidates. Maximal degree in co-relation 6013. Up to 1124 conditions per place. [2024-10-11 14:25:32,868 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2024-10-11 14:25:32,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 885 flow [2024-10-11 14:25:32,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-10-11 14:25:32,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64375 [2024-10-11 14:25:32,869 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 322 flow. Second operand 5 states and 103 transitions. [2024-10-11 14:25:32,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 885 flow [2024-10-11 14:25:32,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 872 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-10-11 14:25:32,884 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 362 flow [2024-10-11 14:25:32,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-10-11 14:25:32,885 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2024-10-11 14:25:32,885 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 362 flow [2024-10-11 14:25:32,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:32,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:32,886 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:32,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:25:32,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:32,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1184458401, now seen corresponding path program 2 times [2024-10-11 14:25:32,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:32,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318187093] [2024-10-11 14:25:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:32,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:32,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:32,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318187093] [2024-10-11 14:25:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318187093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991196038] [2024-10-11 14:25:32,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:32,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:32,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:32,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:32,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:32,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:32,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:32,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:32,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:33,307 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2024-10-11 14:25:33,307 INFO L125 PetriNetUnfolderBase]: For 6916/6916 co-relation queries the response was YES. [2024-10-11 14:25:33,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9747 conditions, 1987 events. 1447/1987 cut-off events. For 6916/6916 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8177 event pairs, 375 based on Foata normal form. 68/2045 useless extension candidates. Maximal degree in co-relation 8621. Up to 1150 conditions per place. [2024-10-11 14:25:33,325 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2024-10-11 14:25:33,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 1092 flow [2024-10-11 14:25:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-10-11 14:25:33,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.69375 [2024-10-11 14:25:33,327 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 362 flow. Second operand 5 states and 111 transitions. [2024-10-11 14:25:33,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 1092 flow [2024-10-11 14:25:33,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1034 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-10-11 14:25:33,343 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 399 flow [2024-10-11 14:25:33,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-10-11 14:25:33,345 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-10-11 14:25:33,345 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 399 flow [2024-10-11 14:25:33,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:25:33,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:33,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:33,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:25:33,346 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:33,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash -547718246, now seen corresponding path program 1 times [2024-10-11 14:25:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:33,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974215916] [2024-10-11 14:25:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:33,852 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:25:33,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:33,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974215916] [2024-10-11 14:25:33,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974215916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:25:33,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802493563] [2024-10-11 14:25:33,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:33,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:25:33,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:25:33,855 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:25:33,857 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:25:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:34,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 14:25:34,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:25:36,733 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:25:36,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:25:37,660 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:25:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802493563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:25:37,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:25:37,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-10-11 14:25:37,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422302323] [2024-10-11 14:25:37,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:25:37,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 14:25:37,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:37,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 14:25:37,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:25:37,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:37,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 399 flow. Second operand has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 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:25:37,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:37,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:37,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:40,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:25:45,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:25:48,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:25:52,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:25:56,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:25:57,122 INFO L124 PetriNetUnfolderBase]: 2703/3713 cut-off events. [2024-10-11 14:25:57,123 INFO L125 PetriNetUnfolderBase]: For 13289/13289 co-relation queries the response was YES. [2024-10-11 14:25:57,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18344 conditions, 3713 events. 2703/3713 cut-off events. For 13289/13289 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 16593 event pairs, 281 based on Foata normal form. 15/3718 useless extension candidates. Maximal degree in co-relation 16239. Up to 2092 conditions per place. [2024-10-11 14:25:57,153 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 179 selfloop transitions, 100 changer transitions 20/304 dead transitions. [2024-10-11 14:25:57,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 304 transitions, 2710 flow [2024-10-11 14:25:57,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 14:25:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 14:25:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 345 transitions. [2024-10-11 14:25:57,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.673828125 [2024-10-11 14:25:57,156 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 399 flow. Second operand 16 states and 345 transitions. [2024-10-11 14:25:57,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 304 transitions, 2710 flow [2024-10-11 14:25:57,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 304 transitions, 2621 flow, removed 32 selfloop flow, removed 1 redundant places. [2024-10-11 14:25:57,182 INFO L231 Difference]: Finished difference. Result has 94 places, 153 transitions, 1634 flow [2024-10-11 14:25:57,182 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1634, PETRI_PLACES=94, PETRI_TRANSITIONS=153} [2024-10-11 14:25:57,182 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 58 predicate places. [2024-10-11 14:25:57,183 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 153 transitions, 1634 flow [2024-10-11 14:25:57,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 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:25:57,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:57,183 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:57,202 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:25:57,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:25:57,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:57,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1299393706, now seen corresponding path program 1 times [2024-10-11 14:25:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:57,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039319604] [2024-10-11 14:25:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:57,807 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:25:57,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:57,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039319604] [2024-10-11 14:25:57,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039319604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:25:57,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444277438] [2024-10-11 14:25:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:57,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:25:57,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:25:57,813 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:25:57,814 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:25:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:58,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 14:25:58,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:25:59,833 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:25:59,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:26:00,434 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:26:00,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444277438] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:26:00,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:26:00,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-10-11 14:26:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697485900] [2024-10-11 14:26:00,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:26:00,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 14:26:00,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:26:00,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 14:26:00,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:26:00,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:26:00,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 153 transitions, 1634 flow. Second operand has 16 states, 16 states have (on average 12.4375) internal successors, (199), 16 states have internal predecessors, (199), 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:26:00,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:26:00,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:26:00,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:26:08,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:26:10,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:26:15,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:26:19,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:26:20,515 INFO L124 PetriNetUnfolderBase]: 4344/5997 cut-off events. [2024-10-11 14:26:20,516 INFO L125 PetriNetUnfolderBase]: For 27758/27758 co-relation queries the response was YES. [2024-10-11 14:26:20,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34295 conditions, 5997 events. 4344/5997 cut-off events. For 27758/27758 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 29489 event pairs, 245 based on Foata normal form. 21/6008 useless extension candidates. Maximal degree in co-relation 33817. Up to 3970 conditions per place. [2024-10-11 14:26:20,588 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 313 selfloop transitions, 100 changer transitions 15/433 dead transitions. [2024-10-11 14:26:20,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 433 transitions, 4397 flow [2024-10-11 14:26:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 14:26:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 14:26:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 376 transitions. [2024-10-11 14:26:20,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.734375 [2024-10-11 14:26:20,592 INFO L175 Difference]: Start difference. First operand has 94 places, 153 transitions, 1634 flow. Second operand 16 states and 376 transitions. [2024-10-11 14:26:20,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 433 transitions, 4397 flow [2024-10-11 14:26:20,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 433 transitions, 4198 flow, removed 97 selfloop flow, removed 1 redundant places. [2024-10-11 14:26:20,752 INFO L231 Difference]: Finished difference. Result has 118 places, 251 transitions, 2803 flow [2024-10-11 14:26:20,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2803, PETRI_PLACES=118, PETRI_TRANSITIONS=251} [2024-10-11 14:26:20,753 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 82 predicate places. [2024-10-11 14:26:20,753 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 251 transitions, 2803 flow [2024-10-11 14:26:20,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.4375) internal successors, (199), 16 states have internal predecessors, (199), 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:26:20,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:26:20,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:26:20,773 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:26:20,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:26:20,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:26:20,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:26:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2006499628, now seen corresponding path program 2 times [2024-10-11 14:26:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:26:20,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291773602] [2024-10-11 14:26:20,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:26:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:26:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:26:21,345 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:26:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:26:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291773602] [2024-10-11 14:26:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291773602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:26:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082141397] [2024-10-11 14:26:21,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:26:21,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:26:21,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:26:21,347 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:26:21,348 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:26:21,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:26:21,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:26:21,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 14:26:21,634 INFO L278 TraceCheckSpWp]: Computing forward predicates...