./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:44:57,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:44:57,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:44:57,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:44:57,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:44:57,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:44:57,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:44:57,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:44:57,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:44:57,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:44:57,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:44:57,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:44:57,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:44:57,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:44:57,694 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:44:57,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:44:57,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:44:57,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:44:57,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:44:57,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:44:57,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:44:57,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:44:57,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:57,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:44:57,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:44:57,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:44:57,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:44:57,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:57,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:44:57,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:44:57,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:44:57,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:44:57,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:44:57,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:44:57,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:44:57,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:44:57,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:44:57,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:44:57,698 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 [2025-01-09 16:44:57,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:44:57,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:44:57,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:44:57,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:44:57,895 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:44:57,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-01-09 16:44:59,041 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66d5dd572/1b54cde73cbd49fcab48b6fb77169f5f/FLAG59cd073b1 [2025-01-09 16:44:59,257 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:44:59,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-01-09 16:44:59,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66d5dd572/1b54cde73cbd49fcab48b6fb77169f5f/FLAG59cd073b1 [2025-01-09 16:44:59,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66d5dd572/1b54cde73cbd49fcab48b6fb77169f5f [2025-01-09 16:44:59,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:44:59,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:44:59,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:44:59,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:44:59,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:44:59,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d995cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59, skipping insertion in model container [2025-01-09 16:44:59,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:44:59,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c[4151,4164] [2025-01-09 16:44:59,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:44:59,777 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:44:59,793 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c[4151,4164] [2025-01-09 16:44:59,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:44:59,804 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:44:59,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59 WrapperNode [2025-01-09 16:44:59,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:44:59,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:44:59,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:44:59,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:44:59,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,836 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 274 [2025-01-09 16:44:59,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:44:59,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:44:59,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:44:59,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:44:59,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,872 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-09 16:44:59,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:44:59,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:44:59,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:44:59,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:44:59,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (1/1) ... [2025-01-09 16:44:59,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:59,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:59,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:44:59,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:44:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:44:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:44:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:44:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:44:59,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:44:59,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:44:59,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:44:59,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:44:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:44:59,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:44:59,943 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:45:00,031 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:45:00,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:45:00,394 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:45:00,396 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:45:00,626 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:45:00,627 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:45:00,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:00 BoogieIcfgContainer [2025-01-09 16:45:00,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:45:00,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:45:00,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:45:00,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:45:00,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:44:59" (1/3) ... [2025-01-09 16:45:00,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cf65fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:45:00, skipping insertion in model container [2025-01-09 16:45:00,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:59" (2/3) ... [2025-01-09 16:45:00,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cf65fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:45:00, skipping insertion in model container [2025-01-09 16:45:00,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:00" (3/3) ... [2025-01-09 16:45:00,632 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2025-01-09 16:45:00,642 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:45:00,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 43 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:45:00,643 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:45:00,682 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:45:00,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 124 flow [2025-01-09 16:45:00,742 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-01-09 16:45:00,744 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:45:00,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 6/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-01-09 16:45:00,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 48 transitions, 124 flow [2025-01-09 16:45:00,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 43 transitions, 110 flow [2025-01-09 16:45:00,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:45:00,770 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;@26ebefea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:45:00,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:45:00,782 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:45:00,782 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2025-01-09 16:45:00,782 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:45:00,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:00,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:00,783 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)] === [2025-01-09 16:45:00,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash -225829310, now seen corresponding path program 1 times [2025-01-09 16:45:00,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:00,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285515736] [2025-01-09 16:45:00,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:00,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:00,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:45:00,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:45:00,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:00,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:01,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:01,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285515736] [2025-01-09 16:45:01,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285515736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:01,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:01,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:45:01,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454468467] [2025-01-09 16:45:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:01,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:45:01,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:01,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:45:01,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:45:01,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:45:01,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:01,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:01,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:45:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:01,431 INFO L124 PetriNetUnfolderBase]: 1029/1752 cut-off events. [2025-01-09 16:45:01,431 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-01-09 16:45:01,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3307 conditions, 1752 events. 1029/1752 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10490 event pairs, 252 based on Foata normal form. 1/1660 useless extension candidates. Maximal degree in co-relation 2793. Up to 989 conditions per place. [2025-01-09 16:45:01,450 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 37 selfloop transitions, 3 changer transitions 1/58 dead transitions. [2025-01-09 16:45:01,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 237 flow [2025-01-09 16:45:01,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:45:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:45:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-01-09 16:45:01,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-01-09 16:45:01,460 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 110 flow. Second operand 3 states and 105 transitions. [2025-01-09 16:45:01,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 237 flow [2025-01-09 16:45:01,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:45:01,469 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 113 flow [2025-01-09 16:45:01,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2025-01-09 16:45:01,474 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-01-09 16:45:01,475 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 113 flow [2025-01-09 16:45:01,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:01,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:01,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:01,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:45:01,476 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)] === [2025-01-09 16:45:01,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1101982675, now seen corresponding path program 1 times [2025-01-09 16:45:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:01,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835528582] [2025-01-09 16:45:01,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:01,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:45:01,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:45:01,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:01,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:01,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:01,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835528582] [2025-01-09 16:45:01,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835528582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:01,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:01,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:45:01,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131356910] [2025-01-09 16:45:01,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:01,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:45:01,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:01,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:45:01,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:45:01,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:45:01,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:01,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:01,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:45:01,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:01,916 INFO L124 PetriNetUnfolderBase]: 1203/1954 cut-off events. [2025-01-09 16:45:01,917 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2025-01-09 16:45:01,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 1954 events. 1203/1954 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11260 event pairs, 362 based on Foata normal form. 64/1921 useless extension candidates. Maximal degree in co-relation 1452. Up to 1131 conditions per place. [2025-01-09 16:45:01,930 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 46 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-01-09 16:45:01,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 263 flow [2025-01-09 16:45:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:45:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:45:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-01-09 16:45:01,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-01-09 16:45:01,932 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 113 flow. Second operand 3 states and 109 transitions. [2025-01-09 16:45:01,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 263 flow [2025-01-09 16:45:01,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:01,935 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 124 flow [2025-01-09 16:45:01,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2025-01-09 16:45:01,937 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-01-09 16:45:01,937 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 124 flow [2025-01-09 16:45:01,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:01,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:01,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:01,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:45:01,937 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)] === [2025-01-09 16:45:01,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:01,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2137114675, now seen corresponding path program 1 times [2025-01-09 16:45:01,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:01,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308699545] [2025-01-09 16:45:01,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:01,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:01,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:45:01,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:45:01,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:01,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:02,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:02,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308699545] [2025-01-09 16:45:02,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308699545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:02,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:02,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:45:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619249172] [2025-01-09 16:45:02,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:02,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:45:02,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:02,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:45:02,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:45:02,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:45:02,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:02,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:02,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:45:02,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:02,257 INFO L124 PetriNetUnfolderBase]: 1424/2332 cut-off events. [2025-01-09 16:45:02,257 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2025-01-09 16:45:02,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5053 conditions, 2332 events. 1424/2332 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13443 event pairs, 399 based on Foata normal form. 27/2260 useless extension candidates. Maximal degree in co-relation 3352. Up to 1290 conditions per place. [2025-01-09 16:45:02,265 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 46 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-01-09 16:45:02,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 279 flow [2025-01-09 16:45:02,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:45:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:45:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-01-09 16:45:02,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7430555555555556 [2025-01-09 16:45:02,267 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 124 flow. Second operand 3 states and 107 transitions. [2025-01-09 16:45:02,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 279 flow [2025-01-09 16:45:02,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:02,268 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 136 flow [2025-01-09 16:45:02,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2025-01-09 16:45:02,269 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-01-09 16:45:02,269 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 136 flow [2025-01-09 16:45:02,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:02,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:02,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:02,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:45:02,269 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)] === [2025-01-09 16:45:02,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash 538980438, now seen corresponding path program 1 times [2025-01-09 16:45:02,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:02,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035724321] [2025-01-09 16:45:02,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:02,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 16:45:02,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 16:45:02,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:02,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035724321] [2025-01-09 16:45:02,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035724321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:02,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:02,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:45:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305313853] [2025-01-09 16:45:02,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:02,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:45:02,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:02,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:45:02,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:45:02,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:45:02,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:02,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:02,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:45:02,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:02,644 INFO L124 PetriNetUnfolderBase]: 1779/2854 cut-off events. [2025-01-09 16:45:02,644 INFO L125 PetriNetUnfolderBase]: For 1450/1450 co-relation queries the response was YES. [2025-01-09 16:45:02,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6679 conditions, 2854 events. 1779/2854 cut-off events. For 1450/1450 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17708 event pairs, 1276 based on Foata normal form. 71/2641 useless extension candidates. Maximal degree in co-relation 3426. Up to 1895 conditions per place. [2025-01-09 16:45:02,656 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 52 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-01-09 16:45:02,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 319 flow [2025-01-09 16:45:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:45:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:45:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-01-09 16:45:02,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2025-01-09 16:45:02,659 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 136 flow. Second operand 4 states and 134 transitions. [2025-01-09 16:45:02,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 319 flow [2025-01-09 16:45:02,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:02,661 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 154 flow [2025-01-09 16:45:02,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-01-09 16:45:02,661 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2025-01-09 16:45:02,661 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 154 flow [2025-01-09 16:45:02,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:02,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:02,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:02,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:45:02,663 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)] === [2025-01-09 16:45:02,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1310480288, now seen corresponding path program 1 times [2025-01-09 16:45:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:02,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213685081] [2025-01-09 16:45:02,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:02,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 16:45:02,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 16:45:02,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:02,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:02,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:02,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213685081] [2025-01-09 16:45:02,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213685081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:02,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:02,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:45:02,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027785616] [2025-01-09 16:45:02,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:02,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:45:02,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:02,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:45:02,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:45:02,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:45:02,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:02,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:02,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:45:02,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:03,029 INFO L124 PetriNetUnfolderBase]: 2311/3846 cut-off events. [2025-01-09 16:45:03,029 INFO L125 PetriNetUnfolderBase]: For 1970/1970 co-relation queries the response was YES. [2025-01-09 16:45:03,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8742 conditions, 3846 events. 2311/3846 cut-off events. For 1970/1970 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 26090 event pairs, 1724 based on Foata normal form. 112/3588 useless extension candidates. Maximal degree in co-relation 6824. Up to 2485 conditions per place. [2025-01-09 16:45:03,046 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 51 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-01-09 16:45:03,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 334 flow [2025-01-09 16:45:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:45:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:45:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-01-09 16:45:03,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-01-09 16:45:03,047 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 154 flow. Second operand 4 states and 132 transitions. [2025-01-09 16:45:03,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 334 flow [2025-01-09 16:45:03,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 330 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:03,049 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 173 flow [2025-01-09 16:45:03,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-01-09 16:45:03,049 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-01-09 16:45:03,050 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 173 flow [2025-01-09 16:45:03,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:03,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:03,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:03,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:45:03,050 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)] === [2025-01-09 16:45:03,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:03,050 INFO L85 PathProgramCache]: Analyzing trace with hash 94850591, now seen corresponding path program 1 times [2025-01-09 16:45:03,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:03,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214824040] [2025-01-09 16:45:03,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:03,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:03,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:45:03,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:45:03,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:03,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:45:03,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:03,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214824040] [2025-01-09 16:45:03,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214824040] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:03,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217733311] [2025-01-09 16:45:03,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:03,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:03,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:03,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:45:03,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:45:03,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:45:03,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:45:03,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:03,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:03,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 16:45:03,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:45:03,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217733311] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:03,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:45:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 5] total 16 [2025-01-09 16:45:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352082621] [2025-01-09 16:45:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:03,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:45:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:03,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:45:03,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:45:03,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2025-01-09 16:45:03,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 173 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:03,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:03,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2025-01-09 16:45:03,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:06,214 INFO L124 PetriNetUnfolderBase]: 22775/31931 cut-off events. [2025-01-09 16:45:06,214 INFO L125 PetriNetUnfolderBase]: For 9869/10093 co-relation queries the response was YES. [2025-01-09 16:45:06,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73224 conditions, 31931 events. 22775/31931 cut-off events. For 9869/10093 co-relation queries the response was YES. Maximal size of possible extension queue 1480. Compared 208812 event pairs, 1016 based on Foata normal form. 20/26393 useless extension candidates. Maximal degree in co-relation 57702. Up to 4266 conditions per place. [2025-01-09 16:45:06,353 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 318 selfloop transitions, 53 changer transitions 5/384 dead transitions. [2025-01-09 16:45:06,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 384 transitions, 1865 flow [2025-01-09 16:45:06,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 16:45:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-09 16:45:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 633 transitions. [2025-01-09 16:45:06,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5733695652173914 [2025-01-09 16:45:06,356 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 173 flow. Second operand 23 states and 633 transitions. [2025-01-09 16:45:06,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 384 transitions, 1865 flow [2025-01-09 16:45:06,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 384 transitions, 1860 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:06,362 INFO L231 Difference]: Finished difference. Result has 97 places, 103 transitions, 577 flow [2025-01-09 16:45:06,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=577, PETRI_PLACES=97, PETRI_TRANSITIONS=103} [2025-01-09 16:45:06,363 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 47 predicate places. [2025-01-09 16:45:06,363 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 103 transitions, 577 flow [2025-01-09 16:45:06,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:06,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:06,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:06,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:45:06,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:06,564 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)] === [2025-01-09 16:45:06,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:06,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1559837787, now seen corresponding path program 2 times [2025-01-09 16:45:06,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:06,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112403962] [2025-01-09 16:45:06,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:45:06,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:06,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:45:06,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 36 statements. [2025-01-09 16:45:06,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:45:06,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:45:06,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:06,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112403962] [2025-01-09 16:45:06,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112403962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:06,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:06,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:45:06,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914152664] [2025-01-09 16:45:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:06,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:06,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:06,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:06,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:45:06,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-01-09 16:45:06,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 103 transitions, 577 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:06,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:06,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-01-09 16:45:06,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:08,984 INFO L124 PetriNetUnfolderBase]: 17531/26499 cut-off events. [2025-01-09 16:45:08,985 INFO L125 PetriNetUnfolderBase]: For 95245/95865 co-relation queries the response was YES. [2025-01-09 16:45:09,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96458 conditions, 26499 events. 17531/26499 cut-off events. For 95245/95865 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 194883 event pairs, 2416 based on Foata normal form. 72/26091 useless extension candidates. Maximal degree in co-relation 92488. Up to 17667 conditions per place. [2025-01-09 16:45:09,449 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 117 selfloop transitions, 23 changer transitions 12/167 dead transitions. [2025-01-09 16:45:09,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 167 transitions, 1204 flow [2025-01-09 16:45:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:45:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:45:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2025-01-09 16:45:09,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6423611111111112 [2025-01-09 16:45:09,452 INFO L175 Difference]: Start difference. First operand has 97 places, 103 transitions, 577 flow. Second operand 6 states and 185 transitions. [2025-01-09 16:45:09,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 167 transitions, 1204 flow [2025-01-09 16:45:10,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 167 transitions, 1178 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:45:10,051 INFO L231 Difference]: Finished difference. Result has 103 places, 117 transitions, 742 flow [2025-01-09 16:45:10,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=103, PETRI_TRANSITIONS=117} [2025-01-09 16:45:10,053 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 53 predicate places. [2025-01-09 16:45:10,053 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 117 transitions, 742 flow [2025-01-09 16:45:10,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:10,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:10,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:10,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:45:10,055 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)] === [2025-01-09 16:45:10,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1022264705, now seen corresponding path program 3 times [2025-01-09 16:45:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:10,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318971375] [2025-01-09 16:45:10,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:45:10,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:10,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:45:10,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-01-09 16:45:10,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:45:10,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:10,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:10,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318971375] [2025-01-09 16:45:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318971375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:10,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:10,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:45:10,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753787188] [2025-01-09 16:45:10,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:10,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:45:10,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:10,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:45:10,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:45:10,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-09 16:45:10,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 117 transitions, 742 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:10,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:10,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-09 16:45:10,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:13,119 INFO L124 PetriNetUnfolderBase]: 17213/27197 cut-off events. [2025-01-09 16:45:13,119 INFO L125 PetriNetUnfolderBase]: For 113848/114670 co-relation queries the response was YES. [2025-01-09 16:45:13,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105662 conditions, 27197 events. 17213/27197 cut-off events. For 113848/114670 co-relation queries the response was YES. Maximal size of possible extension queue 1403. Compared 214299 event pairs, 3069 based on Foata normal form. 407/27060 useless extension candidates. Maximal degree in co-relation 101534. Up to 15550 conditions per place. [2025-01-09 16:45:13,293 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 137 selfloop transitions, 48 changer transitions 9/227 dead transitions. [2025-01-09 16:45:13,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 227 transitions, 1855 flow [2025-01-09 16:45:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:45:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:45:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions. [2025-01-09 16:45:13,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-01-09 16:45:13,295 INFO L175 Difference]: Start difference. First operand has 103 places, 117 transitions, 742 flow. Second operand 8 states and 236 transitions. [2025-01-09 16:45:13,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 227 transitions, 1855 flow [2025-01-09 16:45:13,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 227 transitions, 1816 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:13,790 INFO L231 Difference]: Finished difference. Result has 115 places, 151 transitions, 1225 flow [2025-01-09 16:45:13,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1225, PETRI_PLACES=115, PETRI_TRANSITIONS=151} [2025-01-09 16:45:13,791 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 65 predicate places. [2025-01-09 16:45:13,791 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 151 transitions, 1225 flow [2025-01-09 16:45:13,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:13,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:13,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:13,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:45:13,791 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)] === [2025-01-09 16:45:13,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:13,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1244502497, now seen corresponding path program 4 times [2025-01-09 16:45:13,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:13,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139864794] [2025-01-09 16:45:13,792 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:45:13,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:13,799 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:45:13,808 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:45:13,808 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:45:13,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:14,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:14,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139864794] [2025-01-09 16:45:14,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139864794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:14,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:14,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:45:14,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905267986] [2025-01-09 16:45:14,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:14,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:14,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:14,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:14,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:45:14,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-09 16:45:14,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 151 transitions, 1225 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:14,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:14,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-09 16:45:14,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:17,373 INFO L124 PetriNetUnfolderBase]: 23386/37086 cut-off events. [2025-01-09 16:45:17,374 INFO L125 PetriNetUnfolderBase]: For 202338/204769 co-relation queries the response was YES. [2025-01-09 16:45:17,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156541 conditions, 37086 events. 23386/37086 cut-off events. For 202338/204769 co-relation queries the response was YES. Maximal size of possible extension queue 1630. Compared 299751 event pairs, 3746 based on Foata normal form. 864/37132 useless extension candidates. Maximal degree in co-relation 149321. Up to 21301 conditions per place. [2025-01-09 16:45:17,622 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 128 selfloop transitions, 96 changer transitions 6/280 dead transitions. [2025-01-09 16:45:17,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 280 transitions, 2823 flow [2025-01-09 16:45:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:45:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:45:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 243 transitions. [2025-01-09 16:45:17,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6328125 [2025-01-09 16:45:17,623 INFO L175 Difference]: Start difference. First operand has 115 places, 151 transitions, 1225 flow. Second operand 8 states and 243 transitions. [2025-01-09 16:45:17,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 280 transitions, 2823 flow [2025-01-09 16:45:18,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 280 transitions, 2753 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:18,945 INFO L231 Difference]: Finished difference. Result has 126 places, 210 transitions, 2226 flow [2025-01-09 16:45:18,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2226, PETRI_PLACES=126, PETRI_TRANSITIONS=210} [2025-01-09 16:45:18,945 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 76 predicate places. [2025-01-09 16:45:18,945 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 210 transitions, 2226 flow [2025-01-09 16:45:18,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:18,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:18,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:18,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:45:18,946 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)] === [2025-01-09 16:45:18,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash -996997035, now seen corresponding path program 5 times [2025-01-09 16:45:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368688307] [2025-01-09 16:45:18,946 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:45:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:18,953 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:45:18,959 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:45:18,959 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:45:18,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:19,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:19,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368688307] [2025-01-09 16:45:19,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368688307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:19,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:19,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:45:19,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904102101] [2025-01-09 16:45:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:19,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:19,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:19,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:45:19,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-01-09 16:45:19,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 210 transitions, 2226 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:19,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:19,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-01-09 16:45:19,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:24,656 INFO L124 PetriNetUnfolderBase]: 40822/62139 cut-off events. [2025-01-09 16:45:24,657 INFO L125 PetriNetUnfolderBase]: For 446662/452023 co-relation queries the response was YES. [2025-01-09 16:45:25,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289864 conditions, 62139 events. 40822/62139 cut-off events. For 446662/452023 co-relation queries the response was YES. Maximal size of possible extension queue 3054. Compared 501805 event pairs, 8161 based on Foata normal form. 2068/61930 useless extension candidates. Maximal degree in co-relation 282658. Up to 34395 conditions per place. [2025-01-09 16:45:25,306 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 190 selfloop transitions, 168 changer transitions 6/380 dead transitions. [2025-01-09 16:45:25,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 380 transitions, 4694 flow [2025-01-09 16:45:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:45:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:45:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 247 transitions. [2025-01-09 16:45:25,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6432291666666666 [2025-01-09 16:45:25,308 INFO L175 Difference]: Start difference. First operand has 126 places, 210 transitions, 2226 flow. Second operand 8 states and 247 transitions. [2025-01-09 16:45:25,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 380 transitions, 4694 flow [2025-01-09 16:45:30,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 380 transitions, 4617 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:30,940 INFO L231 Difference]: Finished difference. Result has 136 places, 287 transitions, 3830 flow [2025-01-09 16:45:30,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3830, PETRI_PLACES=136, PETRI_TRANSITIONS=287} [2025-01-09 16:45:30,941 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 86 predicate places. [2025-01-09 16:45:30,941 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 287 transitions, 3830 flow [2025-01-09 16:45:30,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:30,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:30,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:30,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:45:30,941 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)] === [2025-01-09 16:45:30,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash -561971383, now seen corresponding path program 6 times [2025-01-09 16:45:30,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:30,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760191543] [2025-01-09 16:45:30,942 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:45:30,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:30,949 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:45:30,970 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-01-09 16:45:30,970 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:45:30,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:31,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:31,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760191543] [2025-01-09 16:45:31,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760191543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:31,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:31,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:45:31,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008106610] [2025-01-09 16:45:31,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:31,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:45:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:31,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:45:31,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:45:31,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-01-09 16:45:31,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 287 transitions, 3830 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:31,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:31,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-01-09 16:45:31,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:37,659 INFO L124 PetriNetUnfolderBase]: 41268/62634 cut-off events. [2025-01-09 16:45:37,663 INFO L125 PetriNetUnfolderBase]: For 529840/536119 co-relation queries the response was YES. [2025-01-09 16:45:38,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320856 conditions, 62634 events. 41268/62634 cut-off events. For 529840/536119 co-relation queries the response was YES. Maximal size of possible extension queue 3062. Compared 511251 event pairs, 7554 based on Foata normal form. 1532/62093 useless extension candidates. Maximal degree in co-relation 313664. Up to 37959 conditions per place. [2025-01-09 16:45:38,494 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 196 selfloop transitions, 241 changer transitions 13/469 dead transitions. [2025-01-09 16:45:38,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 469 transitions, 6977 flow [2025-01-09 16:45:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:45:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:45:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 262 transitions. [2025-01-09 16:45:38,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6064814814814815 [2025-01-09 16:45:38,496 INFO L175 Difference]: Start difference. First operand has 136 places, 287 transitions, 3830 flow. Second operand 9 states and 262 transitions. [2025-01-09 16:45:38,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 469 transitions, 6977 flow [2025-01-09 16:45:46,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 469 transitions, 6955 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:46,116 INFO L231 Difference]: Finished difference. Result has 147 places, 377 transitions, 6073 flow [2025-01-09 16:45:46,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3816, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6073, PETRI_PLACES=147, PETRI_TRANSITIONS=377} [2025-01-09 16:45:46,116 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 97 predicate places. [2025-01-09 16:45:46,116 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 377 transitions, 6073 flow [2025-01-09 16:45:46,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:46,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:46,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:46,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:45:46,117 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)] === [2025-01-09 16:45:46,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2047031053, now seen corresponding path program 7 times [2025-01-09 16:45:46,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:46,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224387938] [2025-01-09 16:45:46,118 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:45:46,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:46,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:45:46,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:45:46,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:46,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:46,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:46,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224387938] [2025-01-09 16:45:46,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224387938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:46,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:46,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:45:46,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489466059] [2025-01-09 16:45:46,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:46,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:46,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:46,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:46,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:45:46,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-09 16:45:46,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 377 transitions, 6073 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:46,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:46,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-09 16:45:46,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand