./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:38:38,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:38:38,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:38:38,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:38:38,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:38:38,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:38:38,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:38:38,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:38:38,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:38:38,387 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:38:38,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:38:38,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:38:38,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:38:38,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:38:38,388 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:38:38,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:38:38,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:38:38,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:38:38,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:38:38,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:38:38,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:38:38,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:38:38,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:38:38,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:38:38,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:38:38,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:38:38,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:38:38,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:38:38,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:38:38,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:38:38,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:38:38,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:38:38,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:38:38,391 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2025-03-08 17:38:38,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:38:38,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:38:38,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:38:38,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:38:38,612 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:38:38,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-08 17:38:39,787 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc7bc4e9/0245f74097214d9faca4e4390b38852f/FLAGa5ef0c27d [2025-03-08 17:38:40,052 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:38:40,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-08 17:38:40,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc7bc4e9/0245f74097214d9faca4e4390b38852f/FLAGa5ef0c27d [2025-03-08 17:38:40,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc7bc4e9/0245f74097214d9faca4e4390b38852f [2025-03-08 17:38:40,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:38:40,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:38:40,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:38:40,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:38:40,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:38:40,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de75543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40, skipping insertion in model container [2025-03-08 17:38:40,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:38:40,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2730,2743] [2025-03-08 17:38:40,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:38:40,514 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:38:40,531 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2730,2743] [2025-03-08 17:38:40,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:38:40,547 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:38:40,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40 WrapperNode [2025-03-08 17:38:40,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:38:40,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:38:40,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:38:40,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:38:40,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,577 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 129 [2025-03-08 17:38:40,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:38:40,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:38:40,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:38:40,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:38:40,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,606 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 4 writes are split as follows [0, 4]. [2025-03-08 17:38:40,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:38:40,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:38:40,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:38:40,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:38:40,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (1/1) ... [2025-03-08 17:38:40,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:38:40,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:38:40,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:38:40,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:38:40,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:38:40,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:38:40,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:38:40,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:38:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:38:40,675 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:38:40,752 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:38:40,754 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:38:41,022 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:38:41,022 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:38:41,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:38:41,191 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:38:41,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:41 BoogieIcfgContainer [2025-03-08 17:38:41,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:38:41,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:38:41,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:38:41,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:38:41,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:38:40" (1/3) ... [2025-03-08 17:38:41,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9f6062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:41, skipping insertion in model container [2025-03-08 17:38:41,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:40" (2/3) ... [2025-03-08 17:38:41,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9f6062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:41, skipping insertion in model container [2025-03-08 17:38:41,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:41" (3/3) ... [2025-03-08 17:38:41,198 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-03-08 17:38:41,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:38:41,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 17:38:41,211 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:38:41,250 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:38:41,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 99 flow [2025-03-08 17:38:41,316 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-03-08 17:38:41,318 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:38:41,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 7/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-08 17:38:41,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 99 flow [2025-03-08 17:38:41,324 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 35 transitions, 88 flow [2025-03-08 17:38:41,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:38:41,340 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;@6774bd36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:38:41,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:38:41,359 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:38:41,359 INFO L124 PetriNetUnfolderBase]: 7/34 cut-off events. [2025-03-08 17:38:41,359 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:38:41,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:41,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:41,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:41,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:41,365 INFO L85 PathProgramCache]: Analyzing trace with hash -250778368, now seen corresponding path program 1 times [2025-03-08 17:38:41,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:41,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202443033] [2025-03-08 17:38:41,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:41,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:41,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:38:41,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:38:41,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:41,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:41,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202443033] [2025-03-08 17:38:41,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202443033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:38:41,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035356055] [2025-03-08 17:38:41,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:41,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:38:41,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:42,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:38:42,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:38:42,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-08 17:38:42,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:42,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:42,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-08 17:38:42,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:42,211 INFO L124 PetriNetUnfolderBase]: 776/1207 cut-off events. [2025-03-08 17:38:42,212 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-08 17:38:42,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 1207 events. 776/1207 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5308 event pairs, 226 based on Foata normal form. 1/1066 useless extension candidates. Maximal degree in co-relation 2013. Up to 641 conditions per place. [2025-03-08 17:38:42,226 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 44 selfloop transitions, 3 changer transitions 1/54 dead transitions. [2025-03-08 17:38:42,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 237 flow [2025-03-08 17:38:42,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:38:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:38:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-08 17:38:42,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6495726495726496 [2025-03-08 17:38:42,240 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 88 flow. Second operand 3 states and 76 transitions. [2025-03-08 17:38:42,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 237 flow [2025-03-08 17:38:42,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 215 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:38:42,249 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 95 flow [2025-03-08 17:38:42,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-03-08 17:38:42,255 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-03-08 17:38:42,256 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 95 flow [2025-03-08 17:38:42,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:42,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:42,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:42,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:38:42,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:42,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1192136949, now seen corresponding path program 1 times [2025-03-08 17:38:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:42,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456149380] [2025-03-08 17:38:42,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:42,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:38:42,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:38:42,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:42,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:42,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:42,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456149380] [2025-03-08 17:38:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456149380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:42,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:42,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:38:42,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134992489] [2025-03-08 17:38:42,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:42,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:38:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:42,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:38:42,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:38:42,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-08 17:38:42,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:42,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:42,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-08 17:38:42,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:42,683 INFO L124 PetriNetUnfolderBase]: 1314/2173 cut-off events. [2025-03-08 17:38:42,684 INFO L125 PetriNetUnfolderBase]: For 283/283 co-relation queries the response was YES. [2025-03-08 17:38:42,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4346 conditions, 2173 events. 1314/2173 cut-off events. For 283/283 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11316 event pairs, 723 based on Foata normal form. 74/2158 useless extension candidates. Maximal degree in co-relation 1853. Up to 1011 conditions per place. [2025-03-08 17:38:42,696 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 64 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2025-03-08 17:38:42,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 82 transitions, 357 flow [2025-03-08 17:38:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:38:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:38:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-08 17:38:42,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-03-08 17:38:42,698 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 95 flow. Second operand 6 states and 129 transitions. [2025-03-08 17:38:42,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 82 transitions, 357 flow [2025-03-08 17:38:42,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 82 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:38:42,700 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 176 flow [2025-03-08 17:38:42,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2025-03-08 17:38:42,701 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-03-08 17:38:42,701 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 176 flow [2025-03-08 17:38:42,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:42,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:42,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:42,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:38:42,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:42,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash -595096069, now seen corresponding path program 1 times [2025-03-08 17:38:42,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:42,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534549794] [2025-03-08 17:38:42,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:42,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:42,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:38:42,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:38:42,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:42,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:42,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:42,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534549794] [2025-03-08 17:38:42,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534549794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:38:42,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319680989] [2025-03-08 17:38:42,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:38:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:38:42,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:38:42,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:38:42,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:38:42,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:38:42,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:42,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:42,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:38:42,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:38:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:42,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:38:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:43,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319680989] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:38:43,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:38:43,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-08 17:38:43,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212304893] [2025-03-08 17:38:43,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:43,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:38:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:43,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:38:43,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:38:43,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-08 17:38:43,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:43,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:43,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-08 17:38:43,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:43,397 INFO L124 PetriNetUnfolderBase]: 2629/4125 cut-off events. [2025-03-08 17:38:43,397 INFO L125 PetriNetUnfolderBase]: For 2228/2228 co-relation queries the response was YES. [2025-03-08 17:38:43,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9545 conditions, 4125 events. 2629/4125 cut-off events. For 2228/2228 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 22588 event pairs, 1015 based on Foata normal form. 0/3794 useless extension candidates. Maximal degree in co-relation 4278. Up to 1459 conditions per place. [2025-03-08 17:38:43,421 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 87 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2025-03-08 17:38:43,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 100 transitions, 536 flow [2025-03-08 17:38:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:38:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:38:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-08 17:38:43,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-03-08 17:38:43,423 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 176 flow. Second operand 6 states and 129 transitions. [2025-03-08 17:38:43,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 100 transitions, 536 flow [2025-03-08 17:38:43,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 536 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:38:43,427 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 224 flow [2025-03-08 17:38:43,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2025-03-08 17:38:43,427 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-03-08 17:38:43,427 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 224 flow [2025-03-08 17:38:43,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:43,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:43,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:43,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 17:38:43,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:38:43,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash 21194571, now seen corresponding path program 1 times [2025-03-08 17:38:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:43,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774903596] [2025-03-08 17:38:43,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:43,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:38:43,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:38:43,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:43,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:43,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:43,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774903596] [2025-03-08 17:38:43,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774903596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:43,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:43,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:38:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820524563] [2025-03-08 17:38:43,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:43,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:38:43,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:43,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:38:43,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:38:43,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-08 17:38:43,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:43,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:43,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-08 17:38:43,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:43,943 INFO L124 PetriNetUnfolderBase]: 1547/2446 cut-off events. [2025-03-08 17:38:43,943 INFO L125 PetriNetUnfolderBase]: For 1983/1983 co-relation queries the response was YES. [2025-03-08 17:38:43,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6396 conditions, 2446 events. 1547/2446 cut-off events. For 1983/1983 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11623 event pairs, 924 based on Foata normal form. 0/2298 useless extension candidates. Maximal degree in co-relation 4334. Up to 1490 conditions per place. [2025-03-08 17:38:43,954 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 29 selfloop transitions, 6 changer transitions 37/78 dead transitions. [2025-03-08 17:38:43,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 458 flow [2025-03-08 17:38:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:38:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:38:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-03-08 17:38:43,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4829059829059829 [2025-03-08 17:38:43,955 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 224 flow. Second operand 6 states and 113 transitions. [2025-03-08 17:38:43,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 458 flow [2025-03-08 17:38:43,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 458 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:38:43,959 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 177 flow [2025-03-08 17:38:43,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2025-03-08 17:38:43,959 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-03-08 17:38:43,960 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 177 flow [2025-03-08 17:38:43,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:43,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:43,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:43,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:38:43,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2086520050, now seen corresponding path program 1 times [2025-03-08 17:38:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:43,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030615852] [2025-03-08 17:38:43,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:43,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:38:43,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:38:43,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:43,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:44,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030615852] [2025-03-08 17:38:44,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030615852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:38:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129689588] [2025-03-08 17:38:44,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:44,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:38:44,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:38:44,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:38:44,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:38:44,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:38:44,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:38:44,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:44,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:44,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:38:44,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:38:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:44,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:38:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:44,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129689588] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:38:44,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:38:44,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-08 17:38:44,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871315325] [2025-03-08 17:38:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:44,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:38:44,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:44,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:38:44,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:38:44,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-08 17:38:44,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:44,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:44,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-08 17:38:44,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:44,428 INFO L124 PetriNetUnfolderBase]: 1082/1732 cut-off events. [2025-03-08 17:38:44,428 INFO L125 PetriNetUnfolderBase]: For 1355/1355 co-relation queries the response was YES. [2025-03-08 17:38:44,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4494 conditions, 1732 events. 1082/1732 cut-off events. For 1355/1355 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7967 event pairs, 290 based on Foata normal form. 72/1709 useless extension candidates. Maximal degree in co-relation 4471. Up to 891 conditions per place. [2025-03-08 17:38:44,437 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 42 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-03-08 17:38:44,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 321 flow [2025-03-08 17:38:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:38:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:38:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-03-08 17:38:44,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4256410256410256 [2025-03-08 17:38:44,438 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 177 flow. Second operand 5 states and 83 transitions. [2025-03-08 17:38:44,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 321 flow [2025-03-08 17:38:44,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 270 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-03-08 17:38:44,442 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 161 flow [2025-03-08 17:38:44,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-03-08 17:38:44,443 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-03-08 17:38:44,443 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 161 flow [2025-03-08 17:38:44,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:44,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:44,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:44,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 17:38:44,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:38:44,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:44,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2142925860, now seen corresponding path program 1 times [2025-03-08 17:38:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211960140] [2025-03-08 17:38:44,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:44,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:38:44,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:38:44,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:44,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:44,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:44,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211960140] [2025-03-08 17:38:44,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211960140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:38:44,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389042054] [2025-03-08 17:38:44,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:44,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:38:44,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:38:44,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:38:44,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:38:44,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:38:44,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:38:44,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:44,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:44,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:38:44,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:38:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:44,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:38:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:44,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389042054] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:38:44,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:38:44,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-08 17:38:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489618266] [2025-03-08 17:38:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:44,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:38:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:44,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:38:44,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:38:44,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-08 17:38:44,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:44,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:44,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-08 17:38:44,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:45,018 INFO L124 PetriNetUnfolderBase]: 826/1331 cut-off events. [2025-03-08 17:38:45,019 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2025-03-08 17:38:45,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3369 conditions, 1331 events. 826/1331 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5983 event pairs, 410 based on Foata normal form. 82/1366 useless extension candidates. Maximal degree in co-relation 3326. Up to 872 conditions per place. [2025-03-08 17:38:45,037 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 45 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-03-08 17:38:45,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 319 flow [2025-03-08 17:38:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:38:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:38:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-03-08 17:38:45,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-08 17:38:45,039 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 161 flow. Second operand 5 states and 91 transitions. [2025-03-08 17:38:45,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 319 flow [2025-03-08 17:38:45,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 311 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:38:45,041 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 176 flow [2025-03-08 17:38:45,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-03-08 17:38:45,043 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-03-08 17:38:45,043 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 176 flow [2025-03-08 17:38:45,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:45,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:45,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:45,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:38:45,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:38:45,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:45,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash -920124321, now seen corresponding path program 1 times [2025-03-08 17:38:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:45,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401592109] [2025-03-08 17:38:45,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:45,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 17:38:45,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 17:38:45,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:45,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:46,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:46,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401592109] [2025-03-08 17:38:46,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401592109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:38:46,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676358454] [2025-03-08 17:38:46,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:46,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:38:46,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:38:46,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:38:46,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:38:46,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 17:38:46,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 17:38:46,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:46,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:46,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 17:38:46,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:38:46,483 INFO L349 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-03-08 17:38:46,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-03-08 17:38:47,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:38:47,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 499 [2025-03-08 17:38:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:38:51,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:39:16,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:39:16,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2025-03-08 17:39:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:39:34,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676358454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:39:34,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:39:34,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 26 [2025-03-08 17:39:34,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108440856] [2025-03-08 17:39:34,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:39:34,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 17:39:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:39:34,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 17:39:34,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=587, Unknown=5, NotChecked=0, Total=702 [2025-03-08 17:39:38,460 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 [1] [2025-03-08 17:39:42,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:39:42,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-08 17:39:42,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 176 flow. Second operand has 27 states, 27 states have (on average 10.444444444444445) internal successors, (282), 27 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:39:42,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:39:42,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-08 17:39:42,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand