./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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-more-array-sum2.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 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:06:53,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:06:53,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:06:53,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:06:53,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:06:53,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:06:53,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:06:53,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:06:53,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:06:53,382 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:06:53,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:06:53,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:06:53,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:06:53,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:06:53,383 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:06:53,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:06:53,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:06:53,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:06:53,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:06:53,384 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:06:53,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:06:53,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:06:53,385 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2025-03-14 01:06:53,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:06:53,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:06:53,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:06:53,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:06:53,628 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:06:53,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-03-14 01:06:54,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb582aa9/4122a665a1f1475cbbb0e68124085890/FLAGa13fa05f6 [2025-03-14 01:06:54,962 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:06:54,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-03-14 01:06:54,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb582aa9/4122a665a1f1475cbbb0e68124085890/FLAGa13fa05f6 [2025-03-14 01:06:55,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb582aa9/4122a665a1f1475cbbb0e68124085890 [2025-03-14 01:06:55,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:06:55,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:06:55,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:06:55,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:06:55,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:06:55,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e94e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55, skipping insertion in model container [2025-03-14 01:06:55,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:06:55,490 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-more-array-sum2.wvr.c[2638,2651] [2025-03-14 01:06:55,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:06:55,508 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:06:55,525 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-more-array-sum2.wvr.c[2638,2651] [2025-03-14 01:06:55,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:06:55,545 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:06:55,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55 WrapperNode [2025-03-14 01:06:55,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:06:55,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:06:55,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:06:55,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:06:55,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,594 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-03-14 01:06:55,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:06:55,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:06:55,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:06:55,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:06:55,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,631 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-14 01:06:55,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:06:55,655 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:06:55,655 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:06:55,655 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:06:55,656 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:06:55,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:06:55,684 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-14 01:06:55,686 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-14 01:06:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:06:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:06:55,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:06:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:06:55,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:06:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:06:55,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:06:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:06:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:06:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:06:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:06:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:06:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:06:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:06:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:06:55,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:06:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:06:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:06:55,705 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:06:55,794 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:06:55,796 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:06:56,159 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:06:56,160 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:06:56,160 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:06:56,473 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:06:56,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:06:56 BoogieIcfgContainer [2025-03-14 01:06:56,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:06:56,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:06:56,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:06:56,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:06:56,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:06:55" (1/3) ... [2025-03-14 01:06:56,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbf7934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:06:56, skipping insertion in model container [2025-03-14 01:06:56,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (2/3) ... [2025-03-14 01:06:56,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbf7934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:06:56, skipping insertion in model container [2025-03-14 01:06:56,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:06:56" (3/3) ... [2025-03-14 01:06:56,481 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-03-14 01:06:56,492 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:06:56,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 31 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-14 01:06:56,495 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:06:56,542 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:06:56,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 91 flow [2025-03-14 01:06:56,594 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-14 01:06:56,597 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:06:56,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 5/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-14 01:06:56,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 91 flow [2025-03-14 01:06:56,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 31 transitions, 80 flow [2025-03-14 01:06:56,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:06:56,619 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;@4cd3a138, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:06:56,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:06:56,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:06:56,631 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2025-03-14 01:06:56,631 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:06:56,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:56,632 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] [2025-03-14 01:06:56,632 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-14 01:06:56,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:56,635 INFO L85 PathProgramCache]: Analyzing trace with hash -341138598, now seen corresponding path program 1 times [2025-03-14 01:06:56,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:56,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832464399] [2025-03-14 01:06:56,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:56,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:56,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 01:06:56,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:06:56,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:56,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:56,903 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-14 01:06:56,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:56,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832464399] [2025-03-14 01:06:56,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832464399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:06:56,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:06:56,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:06:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012699492] [2025-03-14 01:06:56,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:06:56,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:06:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:56,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:06:56,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:06:56,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-14 01:06:56,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:56,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:56,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-14 01:06:56,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:57,151 INFO L124 PetriNetUnfolderBase]: 618/958 cut-off events. [2025-03-14 01:06:57,151 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-14 01:06:57,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 958 events. 618/958 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3829 event pairs, 126 based on Foata normal form. 1/953 useless extension candidates. Maximal degree in co-relation 1717. Up to 677 conditions per place. [2025-03-14 01:06:57,158 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-03-14 01:06:57,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 217 flow [2025-03-14 01:06:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:06:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:06:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-14 01:06:57,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-14 01:06:57,168 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 80 flow. Second operand 3 states and 66 transitions. [2025-03-14 01:06:57,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 217 flow [2025-03-14 01:06:57,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:06:57,173 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 94 flow [2025-03-14 01:06:57,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-03-14 01:06:57,177 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2025-03-14 01:06:57,177 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 94 flow [2025-03-14 01:06:57,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:57,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:57,178 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] [2025-03-14 01:06:57,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:06:57,178 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-14 01:06:57,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash -426723595, now seen corresponding path program 1 times [2025-03-14 01:06:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:57,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318935912] [2025-03-14 01:06:57,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:57,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:06:57,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:06:57,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:57,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:57,408 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-14 01:06:57,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:57,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318935912] [2025-03-14 01:06:57,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318935912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:06:57,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:06:57,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:06:57,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857515592] [2025-03-14 01:06:57,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:06:57,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:06:57,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:57,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:06:57,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:06:57,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-14 01:06:57,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-14 01:06:57,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:57,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-14 01:06:57,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:57,595 INFO L124 PetriNetUnfolderBase]: 618/969 cut-off events. [2025-03-14 01:06:57,595 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2025-03-14 01:06:57,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 969 events. 618/969 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4055 event pairs, 407 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 812. Up to 897 conditions per place. [2025-03-14 01:06:57,604 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 28 selfloop transitions, 4 changer transitions 1/37 dead transitions. [2025-03-14 01:06:57,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 166 flow [2025-03-14 01:06:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:06:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:06:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-14 01:06:57,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2025-03-14 01:06:57,605 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 94 flow. Second operand 4 states and 61 transitions. [2025-03-14 01:06:57,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 166 flow [2025-03-14 01:06:57,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:06:57,606 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 116 flow [2025-03-14 01:06:57,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2025-03-14 01:06:57,607 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-14 01:06:57,607 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 116 flow [2025-03-14 01:06:57,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-14 01:06:57,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:57,608 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-14 01:06:57,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:06:57,608 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-14 01:06:57,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:57,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1703795047, now seen corresponding path program 1 times [2025-03-14 01:06:57,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163795170] [2025-03-14 01:06:57,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:57,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:06:57,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:06:57,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:57,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:06:57,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:57,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163795170] [2025-03-14 01:06:57,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163795170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:06:57,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:06:57,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:06:57,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928926923] [2025-03-14 01:06:57,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:06:57,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:06:57,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:57,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:06:57,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:06:57,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-03-14 01:06:57,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-14 01:06:57,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:57,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-03-14 01:06:57,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:57,880 INFO L124 PetriNetUnfolderBase]: 791/1162 cut-off events. [2025-03-14 01:06:57,880 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-14 01:06:57,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 1162 events. 791/1162 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4524 event pairs, 246 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2025-03-14 01:06:57,886 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 43 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-03-14 01:06:57,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 248 flow [2025-03-14 01:06:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:06:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:06:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-03-14 01:06:57,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-14 01:06:57,887 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 116 flow. Second operand 4 states and 65 transitions. [2025-03-14 01:06:57,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 248 flow [2025-03-14 01:06:57,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 238 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-14 01:06:57,889 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 127 flow [2025-03-14 01:06:57,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-14 01:06:57,889 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-03-14 01:06:57,889 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 127 flow [2025-03-14 01:06:57,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-14 01:06:57,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:57,890 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-14 01:06:57,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:06:57,890 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-14 01:06:57,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2012892907, now seen corresponding path program 1 times [2025-03-14 01:06:57,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:57,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806508095] [2025-03-14 01:06:57,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:57,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:57,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:06:57,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:06:57,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:57,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:06:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806508095] [2025-03-14 01:06:58,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806508095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:06:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907104666] [2025-03-14 01:06:58,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:58,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:58,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:06:58,028 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-14 01:06:58,028 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-14 01:06:58,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:06:58,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:06:58,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:58,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:58,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:06:58,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:06:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:06:58,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:06:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:06:58,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907104666] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:06:58,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:06:58,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-14 01:06:58,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476592752] [2025-03-14 01:06:58,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:06:58,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:06:58,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:58,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:06:58,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:06:58,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-03-14 01:06:58,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-14 01:06:58,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:58,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-03-14 01:06:58,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:58,363 INFO L124 PetriNetUnfolderBase]: 847/1272 cut-off events. [2025-03-14 01:06:58,364 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2025-03-14 01:06:58,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 1272 events. 847/1272 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5382 event pairs, 228 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 3141. Up to 666 conditions per place. [2025-03-14 01:06:58,372 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-03-14 01:06:58,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 277 flow [2025-03-14 01:06:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:06:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:06:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-14 01:06:58,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4228571428571429 [2025-03-14 01:06:58,375 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 127 flow. Second operand 5 states and 74 transitions. [2025-03-14 01:06:58,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 277 flow [2025-03-14 01:06:58,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:06:58,378 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 146 flow [2025-03-14 01:06:58,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-14 01:06:58,378 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-03-14 01:06:58,380 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 146 flow [2025-03-14 01:06:58,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-14 01:06:58,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:58,380 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-14 01:06:58,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:06:58,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:58,581 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-14 01:06:58,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 631004318, now seen corresponding path program 1 times [2025-03-14 01:06:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640007229] [2025-03-14 01:06:58,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:58,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:06:58,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:06:58,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:58,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:06:59,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640007229] [2025-03-14 01:06:59,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640007229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:06:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470911336] [2025-03-14 01:06:59,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:59,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:59,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:06:59,438 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-14 01:06:59,439 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-14 01:06:59,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:06:59,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:06:59,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:59,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:59,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-14 01:06:59,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:06:59,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-14 01:06:59,586 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-03-14 01:06:59,625 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:06:59,625 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 11 treesize of output 11 [2025-03-14 01:06:59,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03-14 01:06:59,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-14 01:06:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:06:59,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:09,405 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2025-03-14 01:07:09,406 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1578 treesize of output 1148 [2025-03-14 01:07:09,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:09,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 823 treesize of output 759 [2025-03-14 01:07:13,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 42 [2025-03-14 01:07:13,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,180 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,182 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 21 [2025-03-14 01:07:13,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,205 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,207 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-03-14 01:07:13,266 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:07:13,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 82 treesize of output 1 [2025-03-14 01:07:13,281 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:07:13,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 104 treesize of output 1 [2025-03-14 01:07:13,299 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,299 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 68 treesize of output 1 [2025-03-14 01:07:13,307 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,307 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 61 treesize of output 1 [2025-03-14 01:07:13,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2025-03-14 01:07:13,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,331 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,331 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 21 [2025-03-14 01:07:13,347 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,348 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 118 treesize of output 1 [2025-03-14 01:07:13,360 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:07:13,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 106 treesize of output 1 [2025-03-14 01:07:13,371 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,371 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 94 treesize of output 1 [2025-03-14 01:07:13,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,381 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,381 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2025-03-14 01:07:13,400 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,401 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 77 treesize of output 1 [2025-03-14 01:07:13,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,413 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,413 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 28 [2025-03-14 01:07:13,427 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:07:13,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 128 treesize of output 1 [2025-03-14 01:07:13,439 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,440 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 85 treesize of output 1 [2025-03-14 01:07:13,459 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,459 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 44 treesize of output 1 [2025-03-14 01:07:13,477 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,478 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 101 treesize of output 1 [2025-03-14 01:07:13,493 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:07:13,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 1 [2025-03-14 01:07:13,507 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:07:13,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 71 treesize of output 1 [2025-03-14 01:07:13,536 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:07:13,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 82 treesize of output 1 [2025-03-14 01:07:13,551 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:07:13,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 104 treesize of output 1 [2025-03-14 01:07:13,567 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,568 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 68 treesize of output 1 [2025-03-14 01:07:13,582 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,582 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 61 treesize of output 1 [2025-03-14 01:07:13,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2025-03-14 01:07:13,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,614 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,615 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 21 [2025-03-14 01:07:13,631 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:07:13,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 106 treesize of output 1 [2025-03-14 01:07:13,643 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,643 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 94 treesize of output 1 [2025-03-14 01:07:13,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,660 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,661 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2025-03-14 01:07:13,677 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,677 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 77 treesize of output 1 [2025-03-14 01:07:13,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,688 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,688 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:07:13,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:07:13,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 28 [2025-03-14 01:07:13,699 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:07:13,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 128 treesize of output 1 [2025-03-14 01:07:13,710 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,710 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 85 treesize of output 1 [2025-03-14 01:07:13,727 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:07:13,727 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 44 treesize of output 1 [2025-03-14 01:07:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:17,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470911336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:17,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:17,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2025-03-14 01:07:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716418906] [2025-03-14 01:07:17,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:17,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-14 01:07:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:17,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-14 01:07:17,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=652, Unknown=3, NotChecked=0, Total=756 [2025-03-14 01:07:22,316 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-14 01:07:26,425 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-14 01:07:26,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2025-03-14 01:07:26,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 146 flow. Second operand has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 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-14 01:07:26,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:26,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2025-03-14 01:07:26,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:30,966 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-14 01:07:34,984 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-14 01:07:38,009 INFO L124 PetriNetUnfolderBase]: 2074/2966 cut-off events. [2025-03-14 01:07:38,009 INFO L125 PetriNetUnfolderBase]: For 1875/1875 co-relation queries the response was YES. [2025-03-14 01:07:38,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8257 conditions, 2966 events. 2074/2966 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12116 event pairs, 240 based on Foata normal form. 1/2773 useless extension candidates. Maximal degree in co-relation 7278. Up to 1808 conditions per place. [2025-03-14 01:07:38,022 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 115 selfloop transitions, 46 changer transitions 1/163 dead transitions. [2025-03-14 01:07:38,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 163 transitions, 888 flow [2025-03-14 01:07:38,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:07:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:07:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 227 transitions. [2025-03-14 01:07:38,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3603174603174603 [2025-03-14 01:07:38,024 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 146 flow. Second operand 18 states and 227 transitions. [2025-03-14 01:07:38,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 163 transitions, 888 flow [2025-03-14 01:07:38,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 163 transitions, 873 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 01:07:38,029 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 452 flow [2025-03-14 01:07:38,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=452, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2025-03-14 01:07:38,029 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2025-03-14 01:07:38,029 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 452 flow [2025-03-14 01:07:38,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 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-14 01:07:38,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:38,031 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-14 01:07:38,038 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-14 01:07:38,236 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-14 01:07:38,236 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-14 01:07:38,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash -716895094, now seen corresponding path program 2 times [2025-03-14 01:07:38,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:38,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405231258] [2025-03-14 01:07:38,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:07:38,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:38,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:07:38,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:07:38,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:07:38,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:39,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:39,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405231258] [2025-03-14 01:07:39,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405231258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:39,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977937766] [2025-03-14 01:07:39,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:07:39,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:39,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:39,767 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-14 01:07:39,768 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-14 01:07:39,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:07:39,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:07:39,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:07:39,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:39,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-14 01:07:39,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:40,014 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-03-14 01:07:40,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:40,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 19 [2025-03-14 01:07:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:40,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:40,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:40,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 248 treesize of output 232 [2025-03-14 01:07:41,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:41,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 190 [2025-03-14 01:07:41,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:41,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 134 [2025-03-14 01:07:41,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:41,451 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 112 treesize of output 104 [2025-03-14 01:07:41,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:41,479 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 84 treesize of output 68 [2025-03-14 01:07:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977937766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:41,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2025-03-14 01:07:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263609229] [2025-03-14 01:07:41,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:41,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 01:07:41,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:41,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 01:07:41,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-03-14 01:07:43,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-03-14 01:07:43,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 452 flow. Second operand has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 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-14 01:07:43,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:43,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-03-14 01:07:43,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:46,258 INFO L124 PetriNetUnfolderBase]: 1992/3060 cut-off events. [2025-03-14 01:07:46,258 INFO L125 PetriNetUnfolderBase]: For 4020/4058 co-relation queries the response was YES. [2025-03-14 01:07:46,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9704 conditions, 3060 events. 1992/3060 cut-off events. For 4020/4058 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14959 event pairs, 125 based on Foata normal form. 37/3095 useless extension candidates. Maximal degree in co-relation 7303. Up to 1647 conditions per place. [2025-03-14 01:07:46,276 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 135 selfloop transitions, 68 changer transitions 1/208 dead transitions. [2025-03-14 01:07:46,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 208 transitions, 1383 flow [2025-03-14 01:07:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 01:07:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 01:07:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 306 transitions. [2025-03-14 01:07:46,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974025974025974 [2025-03-14 01:07:46,279 INFO L175 Difference]: Start difference. First operand has 63 places, 77 transitions, 452 flow. Second operand 22 states and 306 transitions. [2025-03-14 01:07:46,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 208 transitions, 1383 flow [2025-03-14 01:07:46,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 208 transitions, 1299 flow, removed 38 selfloop flow, removed 2 redundant places. [2025-03-14 01:07:46,289 INFO L231 Difference]: Finished difference. Result has 87 places, 112 transitions, 780 flow [2025-03-14 01:07:46,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=780, PETRI_PLACES=87, PETRI_TRANSITIONS=112} [2025-03-14 01:07:46,291 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 51 predicate places. [2025-03-14 01:07:46,291 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 112 transitions, 780 flow [2025-03-14 01:07:46,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 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-14 01:07:46,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:46,292 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-14 01:07:46,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:07:46,492 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-14 01:07:46,493 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-14 01:07:46,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:46,493 INFO L85 PathProgramCache]: Analyzing trace with hash 666809064, now seen corresponding path program 3 times [2025-03-14 01:07:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:46,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380435379] [2025-03-14 01:07:46,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:07:46,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:46,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:07:46,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 28 statements. [2025-03-14 01:07:46,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:07:46,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:07:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380435379] [2025-03-14 01:07:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380435379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:47,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:47,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:07:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787411081] [2025-03-14 01:07:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:47,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:07:47,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:47,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:07:47,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:07:47,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-14 01:07:47,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 112 transitions, 780 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-14 01:07:47,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:47,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-14 01:07:47,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:48,701 INFO L124 PetriNetUnfolderBase]: 3327/4781 cut-off events. [2025-03-14 01:07:48,701 INFO L125 PetriNetUnfolderBase]: For 8655/8670 co-relation queries the response was YES. [2025-03-14 01:07:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16608 conditions, 4781 events. 3327/4781 cut-off events. For 8655/8670 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22479 event pairs, 280 based on Foata normal form. 13/4791 useless extension candidates. Maximal degree in co-relation 15041. Up to 3113 conditions per place. [2025-03-14 01:07:48,727 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 135 selfloop transitions, 76 changer transitions 1/214 dead transitions. [2025-03-14 01:07:48,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 214 transitions, 1707 flow [2025-03-14 01:07:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:07:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:07:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2025-03-14 01:07:48,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-14 01:07:48,732 INFO L175 Difference]: Start difference. First operand has 87 places, 112 transitions, 780 flow. Second operand 11 states and 168 transitions. [2025-03-14 01:07:48,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 214 transitions, 1707 flow [2025-03-14 01:07:48,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 214 transitions, 1610 flow, removed 27 selfloop flow, removed 7 redundant places. [2025-03-14 01:07:48,754 INFO L231 Difference]: Finished difference. Result has 97 places, 156 transitions, 1316 flow [2025-03-14 01:07:48,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1316, PETRI_PLACES=97, PETRI_TRANSITIONS=156} [2025-03-14 01:07:48,755 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 61 predicate places. [2025-03-14 01:07:48,755 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 156 transitions, 1316 flow [2025-03-14 01:07:48,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-14 01:07:48,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:48,757 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-14 01:07:48,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:07:48,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:07:48,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash 64380806, now seen corresponding path program 4 times [2025-03-14 01:07:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:48,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801275023] [2025-03-14 01:07:48,758 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:07:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:48,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:07:48,782 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:07:48,782 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:07:48,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801275023] [2025-03-14 01:07:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801275023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433775337] [2025-03-14 01:07:49,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:07:49,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:49,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:49,599 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-14 01:07:49,602 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-14 01:07:49,645 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:07:49,665 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:07:49,665 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:07:49,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:49,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-14 01:07:49,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:49,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-14 01:07:49,761 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-03-14 01:07:49,832 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:07:49,832 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 11 treesize of output 11 [2025-03-14 01:07:49,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03-14 01:07:50,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-14 01:07:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:50,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:55,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433775337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:55,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:55,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 28 [2025-03-14 01:07:55,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514289375] [2025-03-14 01:07:55,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:55,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 01:07:55,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:55,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 01:07:55,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=696, Unknown=1, NotChecked=0, Total=812 [2025-03-14 01:07:59,196 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-14 01:08:03,371 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-14 01:08:07,520 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-14 01:08:07,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2025-03-14 01:08:07,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 156 transitions, 1316 flow. Second operand has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 29 states have internal predecessors, (183), 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-14 01:08:07,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:07,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2025-03-14 01:08:07,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:12,179 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-14 01:08:16,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:08:20,739 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-14 01:08:24,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:08:28,984 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-14 01:08:33,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]