./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-cond-4.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/unroll-cond-4.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 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:50:09,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:50:10,025 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:50:10,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:50:10,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:50:10,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:50:10,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:50:10,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:50:10,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:50:10,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:50:10,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:50:10,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:50:10,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:50:10,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:50:10,047 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:50:10,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:50:10,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:50:10,047 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:50:10,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:50:10,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:50:10,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:50:10,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:50:10,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:50:10,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:50:10,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:50:10,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:50:10,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:50:10,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:50:10,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:50:10,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:50:10,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:50:10,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:50:10,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:10,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:50:10,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:50:10,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:50:10,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:50:10,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:10,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:50:10,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:50:10,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:50:10,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:50:10,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:50:10,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:50:10,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:50:10,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:50:10,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:50:10,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:50:10,050 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 -> 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 [2025-01-09 16:50:10,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:50:10,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:50:10,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:50:10,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:50:10,288 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:50:10,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2025-01-09 16:50:11,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ae900b5a/aa2210f796aa4e1fa37a3f181acedf82/FLAGcc409f0b0 [2025-01-09 16:50:11,735 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:50:11,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2025-01-09 16:50:11,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ae900b5a/aa2210f796aa4e1fa37a3f181acedf82/FLAGcc409f0b0 [2025-01-09 16:50:11,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ae900b5a/aa2210f796aa4e1fa37a3f181acedf82 [2025-01-09 16:50:11,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:50:11,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:50:11,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:50:11,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:50:11,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:50:11,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:11,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11, skipping insertion in model container [2025-01-09 16:50:11,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:11,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:50:11,900 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/unroll-cond-4.wvr.c[2834,2847] [2025-01-09 16:50:11,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:50:11,916 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:50:11,933 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/unroll-cond-4.wvr.c[2834,2847] [2025-01-09 16:50:11,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:50:11,947 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:50:11,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11 WrapperNode [2025-01-09 16:50:11,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:50:11,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:50:11,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:50:11,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:50:11,954 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:50:11" (1/1) ... [2025-01-09 16:50:11,959 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:50:11" (1/1) ... [2025-01-09 16:50:11,977 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 167 [2025-01-09 16:50:11,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:50:11,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:50:11,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:50:11,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:50:11,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:11,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:11,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:12,005 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:50:12,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:12,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:12,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:12,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:12,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:12,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:12,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:12,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:50:12,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:50:12,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:50:12,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:50:12,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (1/1) ... [2025-01-09 16:50:12,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:12,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:50:12,048 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:50:12,055 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:50:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:50:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:50:12,074 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:50:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:50:12,074 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:50:12,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:50:12,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:50:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:50:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:50:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:50:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:50:12,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:50:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:50:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:50:12,077 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:50:12,150 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:50:12,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:50:12,402 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:50:12,402 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:50:12,562 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:50:12,562 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:50:12,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:12 BoogieIcfgContainer [2025-01-09 16:50:12,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:50:12,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:50:12,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:50:12,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:50:12,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:50:11" (1/3) ... [2025-01-09 16:50:12,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c6c919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:50:12, skipping insertion in model container [2025-01-09 16:50:12,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:11" (2/3) ... [2025-01-09 16:50:12,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c6c919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:50:12, skipping insertion in model container [2025-01-09 16:50:12,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:12" (3/3) ... [2025-01-09 16:50:12,570 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2025-01-09 16:50:12,581 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:50:12,582 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-4.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:50:12,582 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:50:12,622 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:50:12,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-01-09 16:50:12,665 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-01-09 16:50:12,666 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:50:12,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-01-09 16:50:12,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-01-09 16:50:12,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-01-09 16:50:12,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:50:12,697 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;@55ff8311, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:50:12,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:50:12,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:50:12,726 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-01-09 16:50:12,726 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:50:12,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:12,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:12,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:12,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1526316823, now seen corresponding path program 1 times [2025-01-09 16:50:12,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:12,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47588759] [2025-01-09 16:50:12,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:12,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:12,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:50:12,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:50:12,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:12,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:12,966 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:50:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47588759] [2025-01-09 16:50:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47588759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:12,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:12,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:50:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442773934] [2025-01-09 16:50:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:12,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:50:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:12,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:50:12,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:50:12,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:50:12,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:50:12,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:12,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:50:12,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:13,059 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2025-01-09 16:50:13,060 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 16:50:13,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2025-01-09 16:50:13,063 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-01-09 16:50:13,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2025-01-09 16:50:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:50:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:50:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-01-09 16:50:13,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-01-09 16:50:13,074 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2025-01-09 16:50:13,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2025-01-09 16:50:13,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:50:13,079 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2025-01-09 16:50:13,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2025-01-09 16:50:13,082 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-01-09 16:50:13,084 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2025-01-09 16:50:13,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:50:13,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:13,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:13,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:50:13,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:13,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash 277812956, now seen corresponding path program 1 times [2025-01-09 16:50:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:13,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100286460] [2025-01-09 16:50:13,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:13,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:50:13,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:50:13,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:13,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:13,361 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:50:13,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100286460] [2025-01-09 16:50:13,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100286460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:13,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:13,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:50:13,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782226344] [2025-01-09 16:50:13,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:13,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:50:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:13,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:50:13,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:50:13,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:50:13,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:13,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:13,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:50:13,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:13,532 INFO L124 PetriNetUnfolderBase]: 65/123 cut-off events. [2025-01-09 16:50:13,532 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:50:13,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 123 events. 65/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 324 event pairs, 22 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 248. Up to 71 conditions per place. [2025-01-09 16:50:13,533 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2025-01-09 16:50:13,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 38 transitions, 169 flow [2025-01-09 16:50:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:50:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:50:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-01-09 16:50:13,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-01-09 16:50:13,534 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 5 states and 52 transitions. [2025-01-09 16:50:13,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 38 transitions, 169 flow [2025-01-09 16:50:13,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 38 transitions, 165 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:50:13,535 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 82 flow [2025-01-09 16:50:13,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-01-09 16:50:13,536 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-01-09 16:50:13,536 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 82 flow [2025-01-09 16:50:13,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:13,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:13,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:13,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:50:13,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:13,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash -37007604, now seen corresponding path program 2 times [2025-01-09 16:50:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:13,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441272977] [2025-01-09 16:50:13,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:50:13,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:13,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-09 16:50:13,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-01-09 16:50:13,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:50:13,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:13,696 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:50:13,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:13,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441272977] [2025-01-09 16:50:13,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441272977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:13,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:13,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:50:13,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611047314] [2025-01-09 16:50:13,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:13,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:50:13,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:13,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:50:13,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:50:13,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:50:13,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:13,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:13,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:50:13,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:13,818 INFO L124 PetriNetUnfolderBase]: 100/190 cut-off events. [2025-01-09 16:50:13,818 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-01-09 16:50:13,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 190 events. 100/190 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 585 event pairs, 39 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 531. Up to 120 conditions per place. [2025-01-09 16:50:13,819 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 34 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2025-01-09 16:50:13,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 242 flow [2025-01-09 16:50:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:50:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:50:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-01-09 16:50:13,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-01-09 16:50:13,820 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 82 flow. Second operand 5 states and 48 transitions. [2025-01-09 16:50:13,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 242 flow [2025-01-09 16:50:13,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 225 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 16:50:13,822 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 124 flow [2025-01-09 16:50:13,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2025-01-09 16:50:13,822 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2025-01-09 16:50:13,823 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 124 flow [2025-01-09 16:50:13,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:13,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:13,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:13,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:50:13,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:13,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1211121720, now seen corresponding path program 3 times [2025-01-09 16:50:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062088451] [2025-01-09 16:50:13,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:50:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:13,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-01-09 16:50:13,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-01-09 16:50:13,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:50:13,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:13,956 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:50:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062088451] [2025-01-09 16:50:13,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062088451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:13,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:13,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:50:13,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689811065] [2025-01-09 16:50:13,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:13,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:50:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:13,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:50:13,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:50:13,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:50:13,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:13,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:13,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:50:13,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:14,061 INFO L124 PetriNetUnfolderBase]: 109/204 cut-off events. [2025-01-09 16:50:14,062 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2025-01-09 16:50:14,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 204 events. 109/204 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 659 event pairs, 39 based on Foata normal form. 3/182 useless extension candidates. Maximal degree in co-relation 689. Up to 111 conditions per place. [2025-01-09 16:50:14,063 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 33 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2025-01-09 16:50:14,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 307 flow [2025-01-09 16:50:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:50:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:50:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-01-09 16:50:14,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-01-09 16:50:14,065 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 124 flow. Second operand 5 states and 52 transitions. [2025-01-09 16:50:14,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 307 flow [2025-01-09 16:50:14,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 283 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-01-09 16:50:14,066 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 203 flow [2025-01-09 16:50:14,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-01-09 16:50:14,067 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2025-01-09 16:50:14,067 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 203 flow [2025-01-09 16:50:14,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:14,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:14,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:14,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:50:14,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:14,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash 739344682, now seen corresponding path program 4 times [2025-01-09 16:50:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:14,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847511481] [2025-01-09 16:50:14,068 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:50:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:14,075 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-01-09 16:50:14,089 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:50:14,089 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:50:14,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:14,209 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:50:14,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:14,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847511481] [2025-01-09 16:50:14,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847511481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:14,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:14,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:50:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761768469] [2025-01-09 16:50:14,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:14,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:50:14,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:14,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:50:14,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:50:14,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:50:14,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:14,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:14,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:50:14,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:14,330 INFO L124 PetriNetUnfolderBase]: 106/201 cut-off events. [2025-01-09 16:50:14,330 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2025-01-09 16:50:14,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 201 events. 106/201 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 645 event pairs, 46 based on Foata normal form. 3/179 useless extension candidates. Maximal degree in co-relation 752. Up to 160 conditions per place. [2025-01-09 16:50:14,333 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 29 selfloop transitions, 15 changer transitions 0/45 dead transitions. [2025-01-09 16:50:14,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 365 flow [2025-01-09 16:50:14,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:50:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:50:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-01-09 16:50:14,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-01-09 16:50:14,335 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 203 flow. Second operand 5 states and 47 transitions. [2025-01-09 16:50:14,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 365 flow [2025-01-09 16:50:14,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 352 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:50:14,341 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 296 flow [2025-01-09 16:50:14,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-01-09 16:50:14,343 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2025-01-09 16:50:14,343 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 296 flow [2025-01-09 16:50:14,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:14,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:14,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:14,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:50:14,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:14,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1296165322, now seen corresponding path program 5 times [2025-01-09 16:50:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:14,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21993626] [2025-01-09 16:50:14,346 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:50:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:14,357 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-09 16:50:14,378 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:50:14,378 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:50:14,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:14,501 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:50:14,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:14,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21993626] [2025-01-09 16:50:14,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21993626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:14,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:14,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:50:14,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622361062] [2025-01-09 16:50:14,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:14,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:50:14,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:14,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:50:14,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:50:14,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:50:14,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:14,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:14,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:50:14,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:14,622 INFO L124 PetriNetUnfolderBase]: 107/204 cut-off events. [2025-01-09 16:50:14,622 INFO L125 PetriNetUnfolderBase]: For 641/641 co-relation queries the response was YES. [2025-01-09 16:50:14,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 204 events. 107/204 cut-off events. For 641/641 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 671 event pairs, 34 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 852. Up to 113 conditions per place. [2025-01-09 16:50:14,624 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 35 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2025-01-09 16:50:14,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 432 flow [2025-01-09 16:50:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:50:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:50:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-01-09 16:50:14,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51 [2025-01-09 16:50:14,625 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 296 flow. Second operand 5 states and 51 transitions. [2025-01-09 16:50:14,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 432 flow [2025-01-09 16:50:14,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 378 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-01-09 16:50:14,629 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 282 flow [2025-01-09 16:50:14,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-01-09 16:50:14,629 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2025-01-09 16:50:14,630 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 282 flow [2025-01-09 16:50:14,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:14,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:14,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:14,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:50:14,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:14,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 822461572, now seen corresponding path program 6 times [2025-01-09 16:50:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:14,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411159618] [2025-01-09 16:50:14,631 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:50:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:14,639 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-01-09 16:50:14,656 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-01-09 16:50:14,656 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:50:14,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:14,734 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:50:14,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:14,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411159618] [2025-01-09 16:50:14,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411159618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:14,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:14,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:50:14,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705659608] [2025-01-09 16:50:14,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:14,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:50:14,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:14,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:50:14,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:50:14,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:50:14,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:14,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:14,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:50:14,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:14,827 INFO L124 PetriNetUnfolderBase]: 106/197 cut-off events. [2025-01-09 16:50:14,827 INFO L125 PetriNetUnfolderBase]: For 655/655 co-relation queries the response was YES. [2025-01-09 16:50:14,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 197 events. 106/197 cut-off events. For 655/655 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 604 event pairs, 45 based on Foata normal form. 2/174 useless extension candidates. Maximal degree in co-relation 798. Up to 154 conditions per place. [2025-01-09 16:50:14,829 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 31 selfloop transitions, 15 changer transitions 0/47 dead transitions. [2025-01-09 16:50:14,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 404 flow [2025-01-09 16:50:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:50:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:50:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-01-09 16:50:14,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-01-09 16:50:14,830 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 282 flow. Second operand 5 states and 47 transitions. [2025-01-09 16:50:14,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 404 flow [2025-01-09 16:50:14,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 370 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-09 16:50:14,832 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 294 flow [2025-01-09 16:50:14,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-01-09 16:50:14,833 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2025-01-09 16:50:14,833 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 294 flow [2025-01-09 16:50:14,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:50:14,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:14,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:14,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:50:14,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:14,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash 156355095, now seen corresponding path program 1 times [2025-01-09 16:50:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:14,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676636247] [2025-01-09 16:50:14,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:14,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:50:14,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:50:14,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:14,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:50:14,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:14,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676636247] [2025-01-09 16:50:14,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676636247] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:50:14,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341419037] [2025-01-09 16:50:14,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:50:14,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:50:14,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:50:14,972 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:50:14,977 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:50:15,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:50:15,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:50:15,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:50:15,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:15,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 16:50:15,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:50:15,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:50:15,446 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-01-09 16:50:15,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 169 [2025-01-09 16:50:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:50:18,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:50:25,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2025-01-09 16:50:25,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:50:25,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 188 [2025-01-09 16:50:26,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-01-09 16:50:26,455 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 16:50:26,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2025-01-09 16:50:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:50:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341419037] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:50:26,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:50:26,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2025-01-09 16:50:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225114586] [2025-01-09 16:50:26,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:50:26,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:50:26,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:26,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:50:26,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:50:26,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:50:26,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 294 flow. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 19 states have internal predecessors, (98), 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:50:26,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:26,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:50:26,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:38,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:50:38,844 INFO L124 PetriNetUnfolderBase]: 334/633 cut-off events. [2025-01-09 16:50:38,846 INFO L125 PetriNetUnfolderBase]: For 1708/1708 co-relation queries the response was YES. [2025-01-09 16:50:38,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2492 conditions, 633 events. 334/633 cut-off events. For 1708/1708 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2933 event pairs, 15 based on Foata normal form. 11/539 useless extension candidates. Maximal degree in co-relation 2094. Up to 189 conditions per place. [2025-01-09 16:50:38,850 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 88 selfloop transitions, 52 changer transitions 62/203 dead transitions. [2025-01-09 16:50:38,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 203 transitions, 1600 flow [2025-01-09 16:50:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 16:50:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-09 16:50:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 253 transitions. [2025-01-09 16:50:38,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4517857142857143 [2025-01-09 16:50:38,854 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 294 flow. Second operand 28 states and 253 transitions. [2025-01-09 16:50:38,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 203 transitions, 1600 flow [2025-01-09 16:50:38,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 203 transitions, 1488 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-09 16:50:38,861 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 743 flow [2025-01-09 16:50:38,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=743, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2025-01-09 16:50:38,862 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 66 predicate places. [2025-01-09 16:50:38,862 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 743 flow [2025-01-09 16:50:38,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 19 states have internal predecessors, (98), 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:50:38,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:38,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:38,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:50:39,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:50:39,067 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:50:39,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1080009959, now seen corresponding path program 2 times [2025-01-09 16:50:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:39,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531262917] [2025-01-09 16:50:39,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:50:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:39,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-09 16:50:39,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:50:39,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:50:39,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:50:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531262917] [2025-01-09 16:50:39,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531262917] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:50:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957397614] [2025-01-09 16:50:39,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:50:39,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:50:39,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:50:39,225 INFO L229 MonitoredProcess]: Starting monitored process 3 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:50:39,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:50:39,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-09 16:50:39,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:50:39,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:50:39,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:39,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 16:50:39,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:50:39,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:50:39,688 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-01-09 16:50:39,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 169 [2025-01-09 16:50:53,222 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 16:51:05,407 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 16:51:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:09,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:51:22,352 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 16:51:30,362 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 16:51:39,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-01-09 16:51:39,167 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 16:51:39,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-01-09 16:51:39,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2025-01-09 16:51:39,224 INFO L349 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2025-01-09 16:51:39,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 164 [2025-01-09 16:51:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:39,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957397614] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:51:39,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:51:39,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2025-01-09 16:51:39,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119023267] [2025-01-09 16:51:39,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:51:39,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:51:39,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:39,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:51:39,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:51:39,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:51:39,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 743 flow. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 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:51:39,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:39,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:51:39,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand