./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:43:03,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:43:03,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:43:03,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:43:03,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:43:03,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:43:03,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:43:03,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:43:03,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:43:03,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:43:03,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:43:03,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:43:03,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:43:03,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:43:03,454 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:43:03,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:43:03,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:43:03,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:43:03,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:43:03,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:43:03,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:43:03,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:43:03,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:43:03,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:43:03,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:43:03,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:43:03,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:43:03,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:43:03,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:43:03,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:43:03,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:43:03,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:43:03,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:03,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:43:03,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:43:03,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:43:03,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:43:03,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:03,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:43:03,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:43:03,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:43:03,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:43:03,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:43:03,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:43:03,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:43:03,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:43:03,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:43:03,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:43:03,460 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-01-09 16:43:03,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:43:03,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:43:03,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:43:03,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:43:03,721 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:43:03,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-01-09 16:43:04,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b2a9d0bc/5fd83ce9bf8f4f9786c13807ce4f3ca5/FLAG31ef6036c [2025-01-09 16:43:05,264 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:43:05,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-01-09 16:43:05,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b2a9d0bc/5fd83ce9bf8f4f9786c13807ce4f3ca5/FLAG31ef6036c [2025-01-09 16:43:05,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b2a9d0bc/5fd83ce9bf8f4f9786c13807ce4f3ca5 [2025-01-09 16:43:05,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:43:05,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:43:05,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:43:05,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:43:05,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:43:05,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184491ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05, skipping insertion in model container [2025-01-09 16:43:05,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:43:05,536 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-01-09 16:43:05,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:43:05,560 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:43:05,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-01-09 16:43:05,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:43:05,607 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:43:05,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05 WrapperNode [2025-01-09 16:43:05,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:43:05,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:43:05,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:43:05,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:43:05,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,656 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2025-01-09 16:43:05,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:43:05,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:43:05,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:43:05,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:43:05,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,702 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-09 16:43:05,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:43:05,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:43:05,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:43:05,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:43:05,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:05,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:05,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:43:05,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:43:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:43:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:43:05,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:43:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:43:05,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:43:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:43:05,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:43:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:43:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:43:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:43:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:43:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:43:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:43:05,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:43:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:43:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:43:05,806 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:43:05,933 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:43:05,934 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:43:06,377 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:43:06,377 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:43:06,749 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:43:06,750 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:43:06,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:43:06 BoogieIcfgContainer [2025-01-09 16:43:06,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:43:06,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:43:06,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:43:06,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:43:06,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:43:05" (1/3) ... [2025-01-09 16:43:06,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234871d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:43:06, skipping insertion in model container [2025-01-09 16:43:06,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (2/3) ... [2025-01-09 16:43:06,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234871d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:43:06, skipping insertion in model container [2025-01-09 16:43:06,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:43:06" (3/3) ... [2025-01-09 16:43:06,761 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-01-09 16:43:06,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:43:06,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:43:06,778 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:43:06,834 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:43:06,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-01-09 16:43:06,898 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-01-09 16:43:06,900 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:43:06,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-01-09 16:43:06,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-01-09 16:43:06,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2025-01-09 16:43:06,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:43:06,929 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;@69ad13a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:43:06,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:43:06,947 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:43:06,947 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-01-09 16:43:06,947 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:43:06,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:06,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:06,949 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-01-09 16:43:06,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1659382057, now seen corresponding path program 1 times [2025-01-09 16:43:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:06,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685562362] [2025-01-09 16:43:06,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:07,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:43:07,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:43:07,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:07,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:07,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:07,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685562362] [2025-01-09 16:43:07,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685562362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:07,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:07,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:43:07,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002458532] [2025-01-09 16:43:07,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:07,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:43:07,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:07,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:43:07,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:43:07,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:43:07,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:07,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:07,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:43:07,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:07,811 INFO L124 PetriNetUnfolderBase]: 389/571 cut-off events. [2025-01-09 16:43:07,811 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-01-09 16:43:07,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 571 events. 389/571 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1775 event pairs, 124 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-01-09 16:43:07,820 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 38 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2025-01-09 16:43:07,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 207 flow [2025-01-09 16:43:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:43:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:43:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-01-09 16:43:07,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-01-09 16:43:07,839 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 56 transitions. [2025-01-09 16:43:07,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 207 flow [2025-01-09 16:43:07,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 44 transitions, 185 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:43:07,848 INFO L231 Difference]: Finished difference. Result has 28 places, 30 transitions, 86 flow [2025-01-09 16:43:07,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=30} [2025-01-09 16:43:07,853 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-01-09 16:43:07,854 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 30 transitions, 86 flow [2025-01-09 16:43:07,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:07,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:07,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:07,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:43:07,856 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-01-09 16:43:07,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash -833026359, now seen corresponding path program 1 times [2025-01-09 16:43:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:07,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401623582] [2025-01-09 16:43:07,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:07,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:43:07,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:43:07,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:07,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401623582] [2025-01-09 16:43:08,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401623582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:08,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:08,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:43:08,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427731389] [2025-01-09 16:43:08,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:08,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:08,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:08,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:43:08,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:43:08,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 30 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:08,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:08,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:43:08,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:08,366 INFO L124 PetriNetUnfolderBase]: 725/1087 cut-off events. [2025-01-09 16:43:08,367 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2025-01-09 16:43:08,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 1087 events. 725/1087 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3894 event pairs, 417 based on Foata normal form. 42/1123 useless extension candidates. Maximal degree in co-relation 914. Up to 571 conditions per place. [2025-01-09 16:43:08,377 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 56 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2025-01-09 16:43:08,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 69 transitions, 330 flow [2025-01-09 16:43:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:43:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:43:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-01-09 16:43:08,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-01-09 16:43:08,381 INFO L175 Difference]: Start difference. First operand has 28 places, 30 transitions, 86 flow. Second operand 6 states and 88 transitions. [2025-01-09 16:43:08,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 69 transitions, 330 flow [2025-01-09 16:43:08,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 69 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:08,385 INFO L231 Difference]: Finished difference. Result has 36 places, 40 transitions, 166 flow [2025-01-09 16:43:08,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=36, PETRI_TRANSITIONS=40} [2025-01-09 16:43:08,387 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2025-01-09 16:43:08,388 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 40 transitions, 166 flow [2025-01-09 16:43:08,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:08,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:08,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:08,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:43:08,388 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-01-09 16:43:08,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash -491668477, now seen corresponding path program 1 times [2025-01-09 16:43:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:08,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496718203] [2025-01-09 16:43:08,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:08,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:43:08,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:43:08,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:08,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:08,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:08,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496718203] [2025-01-09 16:43:08,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496718203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:08,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:08,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:43:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476483418] [2025-01-09 16:43:08,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:08,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:08,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:08,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:08,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:43:08,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:43:08,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 40 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:08,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:08,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:43:08,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:08,824 INFO L124 PetriNetUnfolderBase]: 640/979 cut-off events. [2025-01-09 16:43:08,824 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2025-01-09 16:43:08,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2515 conditions, 979 events. 640/979 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3505 event pairs, 391 based on Foata normal form. 42/1021 useless extension candidates. Maximal degree in co-relation 1463. Up to 571 conditions per place. [2025-01-09 16:43:08,831 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 54 selfloop transitions, 12 changer transitions 0/67 dead transitions. [2025-01-09 16:43:08,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 67 transitions, 378 flow [2025-01-09 16:43:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:43:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:43:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-01-09 16:43:08,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2025-01-09 16:43:08,833 INFO L175 Difference]: Start difference. First operand has 36 places, 40 transitions, 166 flow. Second operand 6 states and 86 transitions. [2025-01-09 16:43:08,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 67 transitions, 378 flow [2025-01-09 16:43:08,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 378 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:43:08,837 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 208 flow [2025-01-09 16:43:08,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2025-01-09 16:43:08,838 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-01-09 16:43:08,838 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 208 flow [2025-01-09 16:43:08,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:08,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:08,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:08,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:43:08,838 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-01-09 16:43:08,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:08,839 INFO L85 PathProgramCache]: Analyzing trace with hash -409061480, now seen corresponding path program 1 times [2025-01-09 16:43:08,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:08,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205641708] [2025-01-09 16:43:08,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:08,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:08,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:43:08,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:43:08,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:08,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:08,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205641708] [2025-01-09 16:43:08,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205641708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:08,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:08,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:43:08,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275484180] [2025-01-09 16:43:08,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:08,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:08,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:08,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:43:08,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:43:08,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:08,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:08,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:43:08,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:09,202 INFO L124 PetriNetUnfolderBase]: 515/794 cut-off events. [2025-01-09 16:43:09,202 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2025-01-09 16:43:09,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 794 events. 515/794 cut-off events. For 645/645 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2655 event pairs, 324 based on Foata normal form. 27/821 useless extension candidates. Maximal degree in co-relation 1620. Up to 571 conditions per place. [2025-01-09 16:43:09,207 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 26 selfloop transitions, 6 changer transitions 28/61 dead transitions. [2025-01-09 16:43:09,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 390 flow [2025-01-09 16:43:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:43:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:43:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-01-09 16:43:09,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44086021505376344 [2025-01-09 16:43:09,209 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 208 flow. Second operand 6 states and 82 transitions. [2025-01-09 16:43:09,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 390 flow [2025-01-09 16:43:09,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 372 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:43:09,218 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 152 flow [2025-01-09 16:43:09,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-01-09 16:43:09,219 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2025-01-09 16:43:09,219 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 152 flow [2025-01-09 16:43:09,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:09,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:09,220 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-01-09 16:43:09,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:43:09,220 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-01-09 16:43:09,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:09,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1948089269, now seen corresponding path program 1 times [2025-01-09 16:43:09,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:09,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793069939] [2025-01-09 16:43:09,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:09,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:09,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:43:09,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:43:09,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:09,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:09,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793069939] [2025-01-09 16:43:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793069939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613767990] [2025-01-09 16:43:09,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:09,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:09,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:09,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:09,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:43:09,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:43:09,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:43:09,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:09,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:09,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:43:09,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:09,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613767990] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:09,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:43:09,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-09 16:43:09,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369731561] [2025-01-09 16:43:09,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:09,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:09,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:09,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:43:09,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:43:09,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:09,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:09,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:43:09,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:09,854 INFO L124 PetriNetUnfolderBase]: 377/554 cut-off events. [2025-01-09 16:43:09,855 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2025-01-09 16:43:09,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 554 events. 377/554 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1665 event pairs, 150 based on Foata normal form. 50/604 useless extension candidates. Maximal degree in co-relation 1691. Up to 385 conditions per place. [2025-01-09 16:43:09,860 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 40 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2025-01-09 16:43:09,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 296 flow [2025-01-09 16:43:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-01-09 16:43:09,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2025-01-09 16:43:09,862 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 152 flow. Second operand 5 states and 59 transitions. [2025-01-09 16:43:09,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 296 flow [2025-01-09 16:43:09,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 240 flow, removed 22 selfloop flow, removed 9 redundant places. [2025-01-09 16:43:09,867 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 133 flow [2025-01-09 16:43:09,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2025-01-09 16:43:09,868 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2025-01-09 16:43:09,868 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 133 flow [2025-01-09 16:43:09,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:09,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:09,869 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-01-09 16:43:09,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:43:10,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:10,073 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-01-09 16:43:10,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:10,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1125462074, now seen corresponding path program 1 times [2025-01-09 16:43:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:10,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086882126] [2025-01-09 16:43:10,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:10,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:10,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:43:10,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:43:10,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:10,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:10,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086882126] [2025-01-09 16:43:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086882126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923702797] [2025-01-09 16:43:10,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:10,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:10,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:10,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:10,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:43:10,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:43:10,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:43:10,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:10,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:10,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:43:10,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:10,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:10,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923702797] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:43:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-09 16:43:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95699917] [2025-01-09 16:43:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:10,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:10,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:10,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:43:10,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:43:10,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:10,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:10,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:43:10,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:10,605 INFO L124 PetriNetUnfolderBase]: 383/560 cut-off events. [2025-01-09 16:43:10,605 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-01-09 16:43:10,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 560 events. 383/560 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1679 event pairs, 164 based on Foata normal form. 42/602 useless extension candidates. Maximal degree in co-relation 1521. Up to 418 conditions per place. [2025-01-09 16:43:10,610 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 43 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-01-09 16:43:10,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 286 flow [2025-01-09 16:43:10,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-01-09 16:43:10,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2025-01-09 16:43:10,612 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 133 flow. Second operand 5 states and 60 transitions. [2025-01-09 16:43:10,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 286 flow [2025-01-09 16:43:10,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 268 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-09 16:43:10,613 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 143 flow [2025-01-09 16:43:10,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-01-09 16:43:10,614 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2025-01-09 16:43:10,614 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 143 flow [2025-01-09 16:43:10,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:10,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:10,614 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] [2025-01-09 16:43:10,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:43:10,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:10,815 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-01-09 16:43:10,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1436272814, now seen corresponding path program 1 times [2025-01-09 16:43:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:10,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080389802] [2025-01-09 16:43:10,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:10,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:10,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:43:10,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:10,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:10,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:43:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:10,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080389802] [2025-01-09 16:43:10,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080389802] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:10,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277632649] [2025-01-09 16:43:10,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:10,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:10,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:10,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:10,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:43:11,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:43:11,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:11,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:11,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:11,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:43:11,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:43:11,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:43:11,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277632649] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:11,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:43:11,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-09 16:43:11,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695301958] [2025-01-09 16:43:11,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:11,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:11,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:11,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:11,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:43:11,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:43:11,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:11,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:11,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:43:11,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:11,331 INFO L124 PetriNetUnfolderBase]: 432/630 cut-off events. [2025-01-09 16:43:11,331 INFO L125 PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES. [2025-01-09 16:43:11,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 630 events. 432/630 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1900 event pairs, 202 based on Foata normal form. 37/667 useless extension candidates. Maximal degree in co-relation 1851. Up to 502 conditions per place. [2025-01-09 16:43:11,337 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 43 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-01-09 16:43:11,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 302 flow [2025-01-09 16:43:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-01-09 16:43:11,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2025-01-09 16:43:11,339 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 143 flow. Second operand 5 states and 58 transitions. [2025-01-09 16:43:11,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 302 flow [2025-01-09 16:43:11,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 284 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-09 16:43:11,341 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 153 flow [2025-01-09 16:43:11,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-01-09 16:43:11,342 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2025-01-09 16:43:11,343 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 153 flow [2025-01-09 16:43:11,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:11,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:11,344 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:11,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:43:11,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:11,544 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-01-09 16:43:11,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:11,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1374339904, now seen corresponding path program 1 times [2025-01-09 16:43:11,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:11,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801026804] [2025-01-09 16:43:11,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:11,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:43:11,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:43:11,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:11,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:13,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801026804] [2025-01-09 16:43:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801026804] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019707848] [2025-01-09 16:43:13,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:13,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:13,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:13,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:13,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:43:13,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:43:13,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:43:13,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:13,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:13,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 16:43:13,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:13,281 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-01-09 16:43:13,333 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 16:43:13,333 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-01-09 16:43:13,649 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-01-09 16:43:13,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-01-09 16:43:13,746 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 28 treesize of output 12 [2025-01-09 16:43:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:13,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:17,815 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse1 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 ~B~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)))) (= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~B~0.base) (+ ~B~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4)))) (+ .cse1 c_~csum~0 .cse2))))) is different from false [2025-01-09 16:43:21,850 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int#1| c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select |c_#memory_int#1| c_~B~0.base) ~B~0.offset))) (= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ ~B~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))))))) is different from false [2025-01-09 16:43:22,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:43:22,094 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 52 treesize of output 40 [2025-01-09 16:43:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2025-01-09 16:43:22,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019707848] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:22,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:22,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 31 [2025-01-09 16:43:22,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906266825] [2025-01-09 16:43:22,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:22,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 16:43:22,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:22,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 16:43:22,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=735, Unknown=2, NotChecked=114, Total=992 [2025-01-09 16:43:22,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:43:22,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 153 flow. Second operand has 32 states, 32 states have (on average 6.0625) internal successors, (194), 32 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:22,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:22,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:43:22,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:25,556 INFO L124 PetriNetUnfolderBase]: 618/900 cut-off events. [2025-01-09 16:43:25,556 INFO L125 PetriNetUnfolderBase]: For 692/692 co-relation queries the response was YES. [2025-01-09 16:43:25,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 900 events. 618/900 cut-off events. For 692/692 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3045 event pairs, 27 based on Foata normal form. 1/901 useless extension candidates. Maximal degree in co-relation 2812. Up to 659 conditions per place. [2025-01-09 16:43:25,562 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 65 selfloop transitions, 30 changer transitions 1/97 dead transitions. [2025-01-09 16:43:25,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 97 transitions, 579 flow [2025-01-09 16:43:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:43:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:43:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2025-01-09 16:43:25,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3311827956989247 [2025-01-09 16:43:25,566 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 153 flow. Second operand 15 states and 154 transitions. [2025-01-09 16:43:25,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 97 transitions, 579 flow [2025-01-09 16:43:25,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 97 transitions, 552 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-09 16:43:25,568 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 334 flow [2025-01-09 16:43:25,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=334, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2025-01-09 16:43:25,569 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-01-09 16:43:25,571 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 334 flow [2025-01-09 16:43:25,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.0625) internal successors, (194), 32 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:25,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:25,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:25,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:43:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 16:43:25,776 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:43:25,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1621495880, now seen corresponding path program 2 times [2025-01-09 16:43:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297156201] [2025-01-09 16:43:25,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:43:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:25,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:43:25,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:43:25,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:43:25,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:43:27,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:27,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297156201] [2025-01-09 16:43:27,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297156201] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:27,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955698043] [2025-01-09 16:43:27,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:43:27,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:27,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:27,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:27,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:43:27,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:43:27,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:43:27,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:43:27,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:27,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 16:43:27,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:28,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:43:28,060 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 28 treesize of output 20 [2025-01-09 16:43:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:28,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:28,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:43:28,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-01-09 16:43:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:29,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955698043] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:29,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:29,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 7] total 19 [2025-01-09 16:43:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253316860] [2025-01-09 16:43:29,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:29,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 16:43:29,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:29,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 16:43:29,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:43:29,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:43:29,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 334 flow. Second operand has 20 states, 20 states have (on average 6.75) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:29,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:29,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:43:29,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:31,078 INFO L124 PetriNetUnfolderBase]: 720/1047 cut-off events. [2025-01-09 16:43:31,078 INFO L125 PetriNetUnfolderBase]: For 1409/1409 co-relation queries the response was YES. [2025-01-09 16:43:31,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3928 conditions, 1047 events. 720/1047 cut-off events. For 1409/1409 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3561 event pairs, 117 based on Foata normal form. 1/1048 useless extension candidates. Maximal degree in co-relation 3878. Up to 894 conditions per place. [2025-01-09 16:43:31,085 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 69 selfloop transitions, 35 changer transitions 1/106 dead transitions. [2025-01-09 16:43:31,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 106 transitions, 788 flow [2025-01-09 16:43:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:43:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 16:43:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2025-01-09 16:43:31,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33002481389578164 [2025-01-09 16:43:31,087 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 334 flow. Second operand 13 states and 133 transitions. [2025-01-09 16:43:31,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 106 transitions, 788 flow [2025-01-09 16:43:31,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 106 transitions, 715 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-01-09 16:43:31,092 INFO L231 Difference]: Finished difference. Result has 69 places, 79 transitions, 544 flow [2025-01-09 16:43:31,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=544, PETRI_PLACES=69, PETRI_TRANSITIONS=79} [2025-01-09 16:43:31,093 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2025-01-09 16:43:31,093 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 79 transitions, 544 flow [2025-01-09 16:43:31,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.75) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:31,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:31,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:31,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:43:31,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:31,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:43:31,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1359054394, now seen corresponding path program 3 times [2025-01-09 16:43:31,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:31,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031406480] [2025-01-09 16:43:31,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:31,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:31,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:43:31,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:43:31,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:43:31,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:32,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031406480] [2025-01-09 16:43:32,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031406480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:32,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220635271] [2025-01-09 16:43:32,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:32,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:32,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:32,998 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:32,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:43:33,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:43:33,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:43:33,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:43:33,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:33,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 16:43:33,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:33,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:43:33,845 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 28 treesize of output 20 [2025-01-09 16:43:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:33,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:34,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:43:34,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2025-01-09 16:43:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:34,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220635271] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:34,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:34,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 7] total 22 [2025-01-09 16:43:34,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747818721] [2025-01-09 16:43:34,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:34,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 16:43:34,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:34,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 16:43:34,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:43:34,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:43:34,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 79 transitions, 544 flow. Second operand has 23 states, 23 states have (on average 6.478260869565218) internal successors, (149), 23 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:34,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:34,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:43:34,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:36,516 INFO L124 PetriNetUnfolderBase]: 841/1221 cut-off events. [2025-01-09 16:43:36,517 INFO L125 PetriNetUnfolderBase]: For 2558/2558 co-relation queries the response was YES. [2025-01-09 16:43:36,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5054 conditions, 1221 events. 841/1221 cut-off events. For 2558/2558 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4326 event pairs, 144 based on Foata normal form. 1/1222 useless extension candidates. Maximal degree in co-relation 5002. Up to 1045 conditions per place. [2025-01-09 16:43:36,525 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 84 selfloop transitions, 45 changer transitions 1/131 dead transitions. [2025-01-09 16:43:36,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 131 transitions, 1081 flow [2025-01-09 16:43:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:43:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:43:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 146 transitions. [2025-01-09 16:43:36,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3139784946236559 [2025-01-09 16:43:36,527 INFO L175 Difference]: Start difference. First operand has 69 places, 79 transitions, 544 flow. Second operand 15 states and 146 transitions. [2025-01-09 16:43:36,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 131 transitions, 1081 flow [2025-01-09 16:43:36,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 131 transitions, 1035 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-01-09 16:43:36,535 INFO L231 Difference]: Finished difference. Result has 84 places, 99 transitions, 817 flow [2025-01-09 16:43:36,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=817, PETRI_PLACES=84, PETRI_TRANSITIONS=99} [2025-01-09 16:43:36,536 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2025-01-09 16:43:36,536 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 99 transitions, 817 flow [2025-01-09 16:43:36,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.478260869565218) internal successors, (149), 23 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:36,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:36,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:36,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:43:36,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:43:36,738 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:43:36,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 71521124, now seen corresponding path program 4 times [2025-01-09 16:43:36,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:36,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56954626] [2025-01-09 16:43:36,738 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:43:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:36,749 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:43:36,789 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:43:36,789 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:43:36,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:38,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:38,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56954626] [2025-01-09 16:43:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56954626] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589543448] [2025-01-09 16:43:38,293 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:43:38,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:38,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:38,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:38,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:43:38,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:43:38,392 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:43:38,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:43:38,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:38,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 16:43:38,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:38,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:43:38,763 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 28 treesize of output 24 [2025-01-09 16:43:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:38,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:44:35,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:44:35,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2025-01-09 16:44:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:44:35,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589543448] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:44:35,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:44:35,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 24 [2025-01-09 16:44:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589381313] [2025-01-09 16:44:35,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:44:35,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 16:44:35,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:35,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 16:44:35,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=488, Unknown=14, NotChecked=0, Total=600 [2025-01-09 16:44:35,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:44:35,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 99 transitions, 817 flow. Second operand has 25 states, 25 states have (on average 6.72) internal successors, (168), 25 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:35,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:35,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:44:35,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand