./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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-three-array-max.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:56:01,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:56:01,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:56:01,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:56:01,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:56:01,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:56:01,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:56:01,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:56:01,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:56:01,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:56:01,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:56:01,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:56:01,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:56:01,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:56:01,416 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:56:01,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:56:01,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:56:01,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:56:01,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:56:01,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:56:01,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:56:01,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:56:01,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:56:01,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:56:01,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:56:01,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:56:01,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:56:01,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:56:01,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:56:01,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:56:01,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:56:01,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:56:01,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:56:01,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:56:01,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:56:01,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:56:01,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:56:01,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:56:01,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:56:01,419 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 ! overflow) ) 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 -> 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 [2025-01-10 06:56:01,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:56:01,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:56:01,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:56:01,590 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:56:01,590 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:56:01,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-01-10 06:56:02,649 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21dd4ee5e/078c484a7a344fc996bbeccdea84983c/FLAG34f66f51e [2025-01-10 06:56:02,939 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:56:02,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-01-10 06:56:02,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21dd4ee5e/078c484a7a344fc996bbeccdea84983c/FLAG34f66f51e [2025-01-10 06:56:03,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21dd4ee5e/078c484a7a344fc996bbeccdea84983c [2025-01-10 06:56:03,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:56:03,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:56:03,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:56:03,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:56:03,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:56:03,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d169e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03, skipping insertion in model container [2025-01-10 06:56:03,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:56:03,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:56:03,417 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:56:03,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:56:03,443 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:56:03,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03 WrapperNode [2025-01-10 06:56:03,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:56:03,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:56:03,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:56:03,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:56:03,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,478 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 264 [2025-01-10 06:56:03,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:56:03,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:56:03,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:56:03,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:56:03,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,503 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 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-10 06:56:03,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:56:03,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:56:03,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:56:03,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:56:03,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (1/1) ... [2025-01-10 06:56:03,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:56:03,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:03,547 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-10 06:56:03,549 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-10 06:56:03,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:56:03,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:56:03,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:56:03,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:56:03,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:56:03,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:56:03,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:56:03,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:56:03,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:56:03,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:56:03,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:56:03,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:56:03,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:56:03,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:56:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:56:03,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:56:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:56:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:56:03,571 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:56:03,680 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:56:03,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:56:04,075 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:56:04,076 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:56:04,396 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:56:04,396 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:56:04,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:56:04 BoogieIcfgContainer [2025-01-10 06:56:04,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:56:04,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:56:04,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:56:04,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:56:04,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:56:03" (1/3) ... [2025-01-10 06:56:04,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abac531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:56:04, skipping insertion in model container [2025-01-10 06:56:04,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:03" (2/3) ... [2025-01-10 06:56:04,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abac531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:56:04, skipping insertion in model container [2025-01-10 06:56:04,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:56:04" (3/3) ... [2025-01-10 06:56:04,404 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2025-01-10 06:56:04,417 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:56:04,419 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-max.wvr.c that has 4 procedures, 95 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-01-10 06:56:04,419 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:56:04,482 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:56:04,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 105 transitions, 231 flow [2025-01-10 06:56:04,531 INFO L124 PetriNetUnfolderBase]: 11/102 cut-off events. [2025-01-10 06:56:04,533 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:56:04,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 11/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 244 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-01-10 06:56:04,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 105 transitions, 231 flow [2025-01-10 06:56:04,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 220 flow [2025-01-10 06:56:04,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:56:04,550 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;@3c96a5af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:56:04,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-01-10 06:56:04,553 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:56:04,554 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:56:04,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:56:04,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:04,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:56:04,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:04,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:04,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1001612, now seen corresponding path program 1 times [2025-01-10 06:56:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164695798] [2025-01-10 06:56:04,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:04,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:04,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:56:04,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:56:04,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:04,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:04,698 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-10 06:56:04,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:04,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164695798] [2025-01-10 06:56:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164695798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:04,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:04,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:56:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124219453] [2025-01-10 06:56:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:04,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:04,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:04,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:04,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:04,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:04,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-10 06:56:04,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:04,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:04,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:05,172 INFO L124 PetriNetUnfolderBase]: 1150/2328 cut-off events. [2025-01-10 06:56:05,172 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-01-10 06:56:05,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 2328 events. 1150/2328 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16115 event pairs, 826 based on Foata normal form. 3/1740 useless extension candidates. Maximal degree in co-relation 3589. Up to 1529 conditions per place. [2025-01-10 06:56:05,193 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 42 selfloop transitions, 8 changer transitions 0/96 dead transitions. [2025-01-10 06:56:05,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 96 transitions, 310 flow [2025-01-10 06:56:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-01-10 06:56:05,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5976190476190476 [2025-01-10 06:56:05,205 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 220 flow. Second operand 4 states and 251 transitions. [2025-01-10 06:56:05,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 96 transitions, 310 flow [2025-01-10 06:56:05,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:56:05,215 INFO L231 Difference]: Finished difference. Result has 92 places, 96 transitions, 214 flow [2025-01-10 06:56:05,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=92, PETRI_TRANSITIONS=96} [2025-01-10 06:56:05,219 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -8 predicate places. [2025-01-10 06:56:05,219 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 96 transitions, 214 flow [2025-01-10 06:56:05,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-10 06:56:05,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:05,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:56:05,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:56:05,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:05,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash 31050951, now seen corresponding path program 1 times [2025-01-10 06:56:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:05,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008726411] [2025-01-10 06:56:05,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:05,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:05,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:56:05,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:56:05,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:05,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:05,275 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-10 06:56:05,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008726411] [2025-01-10 06:56:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008726411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:05,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:56:05,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084234171] [2025-01-10 06:56:05,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:05,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:05,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:05,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:05,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:05,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 96 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-10 06:56:05,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:05,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:05,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:05,585 INFO L124 PetriNetUnfolderBase]: 1153/2340 cut-off events. [2025-01-10 06:56:05,585 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-10 06:56:05,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 2340 events. 1153/2340 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16148 event pairs, 826 based on Foata normal form. 3/1756 useless extension candidates. Maximal degree in co-relation 3884. Up to 1542 conditions per place. [2025-01-10 06:56:05,601 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 49 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2025-01-10 06:56:05,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 105 transitions, 364 flow [2025-01-10 06:56:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2025-01-10 06:56:05,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-01-10 06:56:05,605 INFO L175 Difference]: Start difference. First operand has 92 places, 96 transitions, 214 flow. Second operand 4 states and 258 transitions. [2025-01-10 06:56:05,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 105 transitions, 364 flow [2025-01-10 06:56:05,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 105 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:05,610 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 280 flow [2025-01-10 06:56:05,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2025-01-10 06:56:05,611 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -5 predicate places. [2025-01-10 06:56:05,611 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 280 flow [2025-01-10 06:56:05,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-10 06:56:05,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:05,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:56:05,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:56:05,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:05,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash -222442677, now seen corresponding path program 1 times [2025-01-10 06:56:05,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:05,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111946993] [2025-01-10 06:56:05,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:05,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:05,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:56:05,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:56:05,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:05,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:05,767 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-10 06:56:05,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:05,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111946993] [2025-01-10 06:56:05,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111946993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:05,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:05,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:56:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452122087] [2025-01-10 06:56:05,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:05,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:05,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:05,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:05,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-01-10 06:56:05,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:05,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:05,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-01-10 06:56:05,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:06,110 INFO L124 PetriNetUnfolderBase]: 1154/2357 cut-off events. [2025-01-10 06:56:06,110 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-10 06:56:06,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 2357 events. 1154/2357 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16239 event pairs, 826 based on Foata normal form. 4/1771 useless extension candidates. Maximal degree in co-relation 3932. Up to 1545 conditions per place. [2025-01-10 06:56:06,123 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 63 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2025-01-10 06:56:06,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 110 transitions, 436 flow [2025-01-10 06:56:06,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2025-01-10 06:56:06,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2025-01-10 06:56:06,126 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 280 flow. Second operand 4 states and 242 transitions. [2025-01-10 06:56:06,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 110 transitions, 436 flow [2025-01-10 06:56:06,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 110 transitions, 436 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:56:06,129 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 344 flow [2025-01-10 06:56:06,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2025-01-10 06:56:06,131 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -1 predicate places. [2025-01-10 06:56:06,131 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 344 flow [2025-01-10 06:56:06,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:06,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:06,132 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:56:06,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:56:06,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:06,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:06,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1621904433, now seen corresponding path program 1 times [2025-01-10 06:56:06,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:06,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060487195] [2025-01-10 06:56:06,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:06,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:56:06,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:56:06,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:06,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060487195] [2025-01-10 06:56:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060487195] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923097054] [2025-01-10 06:56:06,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:06,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:06,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:06,226 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-10 06:56:06,227 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-10 06:56:06,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:56:06,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:56:06,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:06,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:06,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:56:06,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:06,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923097054] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:06,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:06,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 06:56:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992069725] [2025-01-10 06:56:06,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:06,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:56:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:06,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:56:06,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:56:06,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:06,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 344 flow. Second operand has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 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-10 06:56:06,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:06,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:06,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:06,770 INFO L124 PetriNetUnfolderBase]: 1163/2393 cut-off events. [2025-01-10 06:56:06,770 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-01-10 06:56:06,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4127 conditions, 2393 events. 1163/2393 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16408 event pairs, 826 based on Foata normal form. 0/1807 useless extension candidates. Maximal degree in co-relation 3947. Up to 1550 conditions per place. [2025-01-10 06:56:06,783 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 52 selfloop transitions, 37 changer transitions 0/135 dead transitions. [2025-01-10 06:56:06,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 135 transitions, 654 flow [2025-01-10 06:56:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:56:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:56:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 585 transitions. [2025-01-10 06:56:06,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-01-10 06:56:06,785 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 344 flow. Second operand 10 states and 585 transitions. [2025-01-10 06:56:06,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 135 transitions, 654 flow [2025-01-10 06:56:06,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:56:06,788 INFO L231 Difference]: Finished difference. Result has 111 places, 135 transitions, 600 flow [2025-01-10 06:56:06,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=600, PETRI_PLACES=111, PETRI_TRANSITIONS=135} [2025-01-10 06:56:06,789 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-01-10 06:56:06,789 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 135 transitions, 600 flow [2025-01-10 06:56:06,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 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-10 06:56:06,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:06,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:06,797 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-10 06:56:06,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:06,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1694212611, now seen corresponding path program 1 times [2025-01-10 06:56:06,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:06,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333731679] [2025-01-10 06:56:06,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:07,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:56:07,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:56:07,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:07,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:07,078 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-10 06:56:07,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:07,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333731679] [2025-01-10 06:56:07,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333731679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:07,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:07,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:56:07,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893588822] [2025-01-10 06:56:07,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:07,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:56:07,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:07,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:56:07,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:56:07,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2025-01-10 06:56:07,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 135 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-10 06:56:07,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:07,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2025-01-10 06:56:07,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:07,302 INFO L124 PetriNetUnfolderBase]: 1162/2392 cut-off events. [2025-01-10 06:56:07,302 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-01-10 06:56:07,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4187 conditions, 2392 events. 1162/2392 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16378 event pairs, 826 based on Foata normal form. 1/1810 useless extension candidates. Maximal degree in co-relation 4087. Up to 1562 conditions per place. [2025-01-10 06:56:07,316 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 55 selfloop transitions, 30 changer transitions 0/134 dead transitions. [2025-01-10 06:56:07,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 134 transitions, 766 flow [2025-01-10 06:56:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:56:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:56:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2025-01-10 06:56:07,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6793650793650794 [2025-01-10 06:56:07,318 INFO L175 Difference]: Start difference. First operand has 111 places, 135 transitions, 600 flow. Second operand 3 states and 214 transitions. [2025-01-10 06:56:07,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 134 transitions, 766 flow [2025-01-10 06:56:07,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 134 transitions, 671 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-01-10 06:56:07,325 INFO L231 Difference]: Finished difference. Result has 109 places, 134 transitions, 561 flow [2025-01-10 06:56:07,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=561, PETRI_PLACES=109, PETRI_TRANSITIONS=134} [2025-01-10 06:56:07,326 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2025-01-10 06:56:07,326 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 134 transitions, 561 flow [2025-01-10 06:56:07,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-10 06:56:07,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:07,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:07,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:56:07,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:07,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash -153816487, now seen corresponding path program 1 times [2025-01-10 06:56:07,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:07,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682143792] [2025-01-10 06:56:07,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:07,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:56:07,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:56:07,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:07,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:07,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:07,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682143792] [2025-01-10 06:56:07,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682143792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:07,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:07,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:56:07,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868236992] [2025-01-10 06:56:07,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:07,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:07,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:07,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:07,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:07,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2025-01-10 06:56:07,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 134 transitions, 561 flow. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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-10 06:56:07,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:07,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2025-01-10 06:56:07,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:07,680 INFO L124 PetriNetUnfolderBase]: 1160/2390 cut-off events. [2025-01-10 06:56:07,680 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-01-10 06:56:07,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4163 conditions, 2390 events. 1160/2390 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16232 event pairs, 826 based on Foata normal form. 2/1809 useless extension candidates. Maximal degree in co-relation 4064. Up to 1563 conditions per place. [2025-01-10 06:56:07,693 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 71 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2025-01-10 06:56:07,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 132 transitions, 714 flow [2025-01-10 06:56:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2025-01-10 06:56:07,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2025-01-10 06:56:07,695 INFO L175 Difference]: Start difference. First operand has 109 places, 134 transitions, 561 flow. Second operand 4 states and 275 transitions. [2025-01-10 06:56:07,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 132 transitions, 714 flow [2025-01-10 06:56:07,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 132 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:56:07,698 INFO L231 Difference]: Finished difference. Result has 110 places, 132 transitions, 530 flow [2025-01-10 06:56:07,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=530, PETRI_PLACES=110, PETRI_TRANSITIONS=132} [2025-01-10 06:56:07,699 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2025-01-10 06:56:07,699 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 132 transitions, 530 flow [2025-01-10 06:56:07,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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-10 06:56:07,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:07,700 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-01-10 06:56:07,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:56:07,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:07,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:07,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1300667463, now seen corresponding path program 2 times [2025-01-10 06:56:07,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:07,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54159227] [2025-01-10 06:56:07,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:07,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:07,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:56:07,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:56:07,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:56:07,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:07,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:07,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54159227] [2025-01-10 06:56:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54159227] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:07,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542785210] [2025-01-10 06:56:07,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:07,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:07,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:07,768 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-10 06:56:07,772 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-10 06:56:07,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:56:07,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:56:07,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:56:07,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:07,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:56:07,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:07,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:07,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542785210] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:07,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:07,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-01-10 06:56:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035954087] [2025-01-10 06:56:07,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:07,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:07,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:07,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:07,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:07,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:07,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 132 transitions, 530 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-10 06:56:07,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:07,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:07,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:08,135 INFO L124 PetriNetUnfolderBase]: 1160/2389 cut-off events. [2025-01-10 06:56:08,135 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-01-10 06:56:08,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4149 conditions, 2389 events. 1160/2389 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16277 event pairs, 826 based on Foata normal form. 1/1807 useless extension candidates. Maximal degree in co-relation 4058. Up to 1567 conditions per place. [2025-01-10 06:56:08,146 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 70 selfloop transitions, 15 changer transitions 0/131 dead transitions. [2025-01-10 06:56:08,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 131 transitions, 690 flow [2025-01-10 06:56:08,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-01-10 06:56:08,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2025-01-10 06:56:08,150 INFO L175 Difference]: Start difference. First operand has 110 places, 132 transitions, 530 flow. Second operand 4 states and 246 transitions. [2025-01-10 06:56:08,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 131 transitions, 690 flow [2025-01-10 06:56:08,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 131 transitions, 677 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:56:08,153 INFO L231 Difference]: Finished difference. Result has 110 places, 131 transitions, 537 flow [2025-01-10 06:56:08,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=537, PETRI_PLACES=110, PETRI_TRANSITIONS=131} [2025-01-10 06:56:08,153 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2025-01-10 06:56:08,153 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 131 transitions, 537 flow [2025-01-10 06:56:08,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-10 06:56:08,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:08,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:08,159 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-10 06:56:08,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:08,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:08,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash 239251550, now seen corresponding path program 1 times [2025-01-10 06:56:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:08,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904459233] [2025-01-10 06:56:08,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:08,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:56:08,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:56:08,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:08,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:08,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904459233] [2025-01-10 06:56:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904459233] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284549886] [2025-01-10 06:56:08,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:08,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:08,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:08,658 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-10 06:56:08,660 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-10 06:56:08,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:56:08,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:56:08,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:08,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:08,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 06:56:08,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:08,759 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-10 06:56:08,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:08,816 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:08,817 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-10 06:56:08,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:08,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 06:56:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:08,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:08,871 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_92) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2025-01-10 06:56:08,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:08,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-01-10 06:56:08,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:08,951 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 39 treesize of output 35 [2025-01-10 06:56:08,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-01-10 06:56:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-01-10 06:56:08,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284549886] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:08,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:08,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 06:56:08,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556284432] [2025-01-10 06:56:08,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:08,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:56:08,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:08,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:56:08,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-01-10 06:56:08,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 105 [2025-01-10 06:56:08,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 131 transitions, 537 flow. Second operand has 14 states, 14 states have (on average 38.857142857142854) internal successors, (544), 14 states have internal predecessors, (544), 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-10 06:56:08,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:08,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 105 [2025-01-10 06:56:08,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:09,483 INFO L124 PetriNetUnfolderBase]: 1158/2392 cut-off events. [2025-01-10 06:56:09,483 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-01-10 06:56:09,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4185 conditions, 2392 events. 1158/2392 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16271 event pairs, 826 based on Foata normal form. 0/1807 useless extension candidates. Maximal degree in co-relation 4097. Up to 1529 conditions per place. [2025-01-10 06:56:09,501 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 85 selfloop transitions, 24 changer transitions 0/139 dead transitions. [2025-01-10 06:56:09,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 139 transitions, 771 flow [2025-01-10 06:56:09,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:56:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:56:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 487 transitions. [2025-01-10 06:56:09,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42164502164502166 [2025-01-10 06:56:09,503 INFO L175 Difference]: Start difference. First operand has 110 places, 131 transitions, 537 flow. Second operand 11 states and 487 transitions. [2025-01-10 06:56:09,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 139 transitions, 771 flow [2025-01-10 06:56:09,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 741 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:09,506 INFO L231 Difference]: Finished difference. Result has 116 places, 130 transitions, 553 flow [2025-01-10 06:56:09,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=553, PETRI_PLACES=116, PETRI_TRANSITIONS=130} [2025-01-10 06:56:09,506 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 16 predicate places. [2025-01-10 06:56:09,506 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 130 transitions, 553 flow [2025-01-10 06:56:09,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.857142857142854) internal successors, (544), 14 states have internal predecessors, (544), 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-10 06:56:09,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:09,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:09,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:56:09,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:09,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:09,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1173144560, now seen corresponding path program 1 times [2025-01-10 06:56:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:09,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962454660] [2025-01-10 06:56:09,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:09,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:56:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:56:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:09,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962454660] [2025-01-10 06:56:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962454660] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348279276] [2025-01-10 06:56:09,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:09,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:09,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:09,975 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-10 06:56:09,977 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-10 06:56:10,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:56:10,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:56:10,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:10,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:10,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 06:56:10,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:10,060 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-10 06:56:10,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:10,111 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:10,111 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-10 06:56:10,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:56:10,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 06:56:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:10,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:10,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:10,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-01-10 06:56:10,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:10,245 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 33 treesize of output 29 [2025-01-10 06:56:10,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-01-10 06:56:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348279276] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:10,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:10,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 06:56:10,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736305526] [2025-01-10 06:56:10,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:10,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:56:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:10,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:56:10,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=144, Unknown=2, NotChecked=0, Total=182 [2025-01-10 06:56:10,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 105 [2025-01-10 06:56:10,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 130 transitions, 553 flow. Second operand has 14 states, 14 states have (on average 38.857142857142854) internal successors, (544), 14 states have internal predecessors, (544), 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-10 06:56:10,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:10,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 105 [2025-01-10 06:56:10,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:10,812 INFO L124 PetriNetUnfolderBase]: 1158/2391 cut-off events. [2025-01-10 06:56:10,812 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-01-10 06:56:10,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4191 conditions, 2391 events. 1158/2391 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16307 event pairs, 826 based on Foata normal form. 1/1808 useless extension candidates. Maximal degree in co-relation 4101. Up to 1533 conditions per place. [2025-01-10 06:56:10,823 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 78 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2025-01-10 06:56:10,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 133 transitions, 763 flow [2025-01-10 06:56:10,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:56:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:56:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 479 transitions. [2025-01-10 06:56:10,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4147186147186147 [2025-01-10 06:56:10,825 INFO L175 Difference]: Start difference. First operand has 116 places, 130 transitions, 553 flow. Second operand 11 states and 479 transitions. [2025-01-10 06:56:10,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 133 transitions, 763 flow [2025-01-10 06:56:10,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 133 transitions, 725 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:56:10,828 INFO L231 Difference]: Finished difference. Result has 120 places, 129 transitions, 561 flow [2025-01-10 06:56:10,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=561, PETRI_PLACES=120, PETRI_TRANSITIONS=129} [2025-01-10 06:56:10,828 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 20 predicate places. [2025-01-10 06:56:10,828 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 129 transitions, 561 flow [2025-01-10 06:56:10,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.857142857142854) internal successors, (544), 14 states have internal predecessors, (544), 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-10 06:56:10,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:10,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:10,835 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-10 06:56:11,029 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,SelfDestructingSolverStorable8 [2025-01-10 06:56:11,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:11,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2007743516, now seen corresponding path program 1 times [2025-01-10 06:56:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:11,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228533514] [2025-01-10 06:56:11,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:11,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:56:11,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:56:11,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:11,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:11,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:11,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228533514] [2025-01-10 06:56:11,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228533514] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:11,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586667961] [2025-01-10 06:56:11,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:11,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:11,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:11,402 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-10 06:56:11,403 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-10 06:56:11,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:56:11,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:56:11,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:11,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:11,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 06:56:11,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:11,474 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-10 06:56:11,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:11,537 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:56:11,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 06:56:11,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:11,593 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:11,593 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-10 06:56:11,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:11,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 06:56:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:11,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:11,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:11,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-01-10 06:56:11,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:11,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 135 [2025-01-10 06:56:11,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-01-10 06:56:11,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-01-10 06:56:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586667961] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:11,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:11,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 06:56:11,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505255336] [2025-01-10 06:56:11,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:11,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:56:11,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:11,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:56:11,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=417, Unknown=7, NotChecked=0, Total=506 [2025-01-10 06:56:12,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2025-01-10 06:56:12,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 129 transitions, 561 flow. Second operand has 23 states, 23 states have (on average 34.608695652173914) internal successors, (796), 23 states have internal predecessors, (796), 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-10 06:56:12,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:12,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2025-01-10 06:56:12,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:13,064 INFO L124 PetriNetUnfolderBase]: 1157/2387 cut-off events. [2025-01-10 06:56:13,064 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-10 06:56:13,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4190 conditions, 2387 events. 1157/2387 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16237 event pairs, 826 based on Foata normal form. 1/1807 useless extension candidates. Maximal degree in co-relation 4100. Up to 1530 conditions per place. [2025-01-10 06:56:13,075 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 80 selfloop transitions, 28 changer transitions 0/134 dead transitions. [2025-01-10 06:56:13,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 134 transitions, 785 flow [2025-01-10 06:56:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:56:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:56:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 547 transitions. [2025-01-10 06:56:13,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37210884353741497 [2025-01-10 06:56:13,077 INFO L175 Difference]: Start difference. First operand has 120 places, 129 transitions, 561 flow. Second operand 14 states and 547 transitions. [2025-01-10 06:56:13,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 134 transitions, 785 flow [2025-01-10 06:56:13,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 134 transitions, 733 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-01-10 06:56:13,080 INFO L231 Difference]: Finished difference. Result has 124 places, 128 transitions, 573 flow [2025-01-10 06:56:13,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=573, PETRI_PLACES=124, PETRI_TRANSITIONS=128} [2025-01-10 06:56:13,081 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 24 predicate places. [2025-01-10 06:56:13,081 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 128 transitions, 573 flow [2025-01-10 06:56:13,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 34.608695652173914) internal successors, (796), 23 states have internal predecessors, (796), 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-10 06:56:13,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:13,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:13,090 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-10 06:56:13,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:56:13,283 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:13,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2110505882, now seen corresponding path program 1 times [2025-01-10 06:56:13,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:13,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382747927] [2025-01-10 06:56:13,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:13,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:13,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:56:13,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:56:13,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:13,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:13,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:13,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382747927] [2025-01-10 06:56:13,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382747927] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:13,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608658061] [2025-01-10 06:56:13,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:13,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:13,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:13,625 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-10 06:56:13,626 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-10 06:56:13,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:56:13,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:56:13,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:13,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:13,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 06:56:13,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:13,708 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-10 06:56:13,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:13,755 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:56:13,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 06:56:13,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:56:13,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:13,810 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-10 06:56:13,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:56:13,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 06:56:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:13,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:14,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:14,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-01-10 06:56:14,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:14,087 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 63 treesize of output 59 [2025-01-10 06:56:14,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2025-01-10 06:56:14,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-10 06:56:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:14,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608658061] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:14,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:14,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-10 06:56:14,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546691318] [2025-01-10 06:56:14,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:14,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 06:56:14,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:14,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 06:56:14,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=461, Unknown=4, NotChecked=0, Total=552 [2025-01-10 06:56:14,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2025-01-10 06:56:14,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 128 transitions, 573 flow. Second operand has 24 states, 24 states have (on average 34.583333333333336) internal successors, (830), 24 states have internal predecessors, (830), 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-10 06:56:14,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:14,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2025-01-10 06:56:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:15,149 INFO L124 PetriNetUnfolderBase]: 1157/2387 cut-off events. [2025-01-10 06:56:15,149 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-01-10 06:56:15,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 2387 events. 1157/2387 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16267 event pairs, 826 based on Foata normal form. 4/1812 useless extension candidates. Maximal degree in co-relation 4135. Up to 1534 conditions per place. [2025-01-10 06:56:15,156 INFO L140 encePairwiseOnDemand]: 84/105 looper letters, 74 selfloop transitions, 32 changer transitions 1/133 dead transitions. [2025-01-10 06:56:15,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 133 transitions, 809 flow [2025-01-10 06:56:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:56:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:56:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 639 transitions. [2025-01-10 06:56:15,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35798319327731093 [2025-01-10 06:56:15,158 INFO L175 Difference]: Start difference. First operand has 124 places, 128 transitions, 573 flow. Second operand 17 states and 639 transitions. [2025-01-10 06:56:15,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 133 transitions, 809 flow [2025-01-10 06:56:15,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 789 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:15,161 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 646 flow [2025-01-10 06:56:15,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=646, PETRI_PLACES=139, PETRI_TRANSITIONS=131} [2025-01-10 06:56:15,162 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 39 predicate places. [2025-01-10 06:56:15,162 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 646 flow [2025-01-10 06:56:15,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 34.583333333333336) internal successors, (830), 24 states have internal predecessors, (830), 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-10 06:56:15,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:15,162 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:15,171 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-10 06:56:15,363 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,SelfDestructingSolverStorable10 [2025-01-10 06:56:15,363 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:15,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash -367162844, now seen corresponding path program 1 times [2025-01-10 06:56:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:15,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227438383] [2025-01-10 06:56:15,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:15,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:15,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:56:15,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:56:15,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:15,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:56:15,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:15,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227438383] [2025-01-10 06:56:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227438383] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365650747] [2025-01-10 06:56:15,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:15,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:15,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:15,459 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-10 06:56:15,463 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-10 06:56:15,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:56:15,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:56:15,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:15,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:15,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:56:15,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:56:15,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:56:15,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365650747] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:15,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:15,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-01-10 06:56:15,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090937252] [2025-01-10 06:56:15,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:15,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:56:15,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:15,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:56:15,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:56:15,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:15,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 131 transitions, 646 flow. Second operand has 19 states, 19 states have (on average 50.21052631578947) internal successors, (954), 19 states have internal predecessors, (954), 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-10 06:56:15,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:15,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:15,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:16,467 INFO L124 PetriNetUnfolderBase]: 2301/4722 cut-off events. [2025-01-10 06:56:16,467 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-01-10 06:56:16,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8228 conditions, 4722 events. 2301/4722 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 34324 event pairs, 1652 based on Foata normal form. 2/3585 useless extension candidates. Maximal degree in co-relation 8176. Up to 1551 conditions per place. [2025-01-10 06:56:16,486 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 94 selfloop transitions, 43 changer transitions 0/180 dead transitions. [2025-01-10 06:56:16,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 180 transitions, 1145 flow [2025-01-10 06:56:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:56:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:56:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 599 transitions. [2025-01-10 06:56:16,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5704761904761905 [2025-01-10 06:56:16,488 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 646 flow. Second operand 10 states and 599 transitions. [2025-01-10 06:56:16,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 180 transitions, 1145 flow [2025-01-10 06:56:16,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 180 transitions, 1079 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-01-10 06:56:16,493 INFO L231 Difference]: Finished difference. Result has 140 places, 137 transitions, 743 flow [2025-01-10 06:56:16,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=743, PETRI_PLACES=140, PETRI_TRANSITIONS=137} [2025-01-10 06:56:16,495 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2025-01-10 06:56:16,495 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 137 transitions, 743 flow [2025-01-10 06:56:16,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 50.21052631578947) internal successors, (954), 19 states have internal predecessors, (954), 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-10 06:56:16,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:16,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:16,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:56:16,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:16,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:16,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:16,697 INFO L85 PathProgramCache]: Analyzing trace with hash -730014116, now seen corresponding path program 1 times [2025-01-10 06:56:16,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:16,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119363800] [2025-01-10 06:56:16,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:16,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:16,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:56:16,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:56:16,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:16,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:56:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119363800] [2025-01-10 06:56:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119363800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:16,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:56:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102145621] [2025-01-10 06:56:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:16,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:56:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:16,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:56:16,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:56:16,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 105 [2025-01-10 06:56:16,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 137 transitions, 743 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-10 06:56:16,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:16,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 105 [2025-01-10 06:56:16,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:17,188 INFO L124 PetriNetUnfolderBase]: 2301/4710 cut-off events. [2025-01-10 06:56:17,189 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2025-01-10 06:56:17,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8247 conditions, 4710 events. 2301/4710 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 34408 event pairs, 1652 based on Foata normal form. 2/3560 useless extension candidates. Maximal degree in co-relation 8194. Up to 3107 conditions per place. [2025-01-10 06:56:17,205 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 87 selfloop transitions, 20 changer transitions 0/139 dead transitions. [2025-01-10 06:56:17,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 139 transitions, 961 flow [2025-01-10 06:56:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:56:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:56:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-01-10 06:56:17,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2025-01-10 06:56:17,208 INFO L175 Difference]: Start difference. First operand has 140 places, 137 transitions, 743 flow. Second operand 6 states and 303 transitions. [2025-01-10 06:56:17,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 139 transitions, 961 flow [2025-01-10 06:56:17,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 139 transitions, 889 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:56:17,213 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 741 flow [2025-01-10 06:56:17,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2025-01-10 06:56:17,214 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 41 predicate places. [2025-01-10 06:56:17,214 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 741 flow [2025-01-10 06:56:17,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-10 06:56:17,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:17,215 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1] [2025-01-10 06:56:17,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:56:17,215 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:17,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash 275248526, now seen corresponding path program 2 times [2025-01-10 06:56:17,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:17,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668571219] [2025-01-10 06:56:17,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:17,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:17,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 06:56:17,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:56:17,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:56:17,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:56:17,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:17,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668571219] [2025-01-10 06:56:17,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668571219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039893679] [2025-01-10 06:56:17,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:17,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:17,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:17,266 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:17,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:56:17,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 06:56:17,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:56:17,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:56:17,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:17,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:56:17,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:56:17,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:56:17,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039893679] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:17,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:17,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-10 06:56:17,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503615332] [2025-01-10 06:56:17,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:17,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:56:17,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:17,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:56:17,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:56:17,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:17,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 139 transitions, 741 flow. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 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-10 06:56:17,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:17,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:17,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:17,764 INFO L124 PetriNetUnfolderBase]: 2303/4708 cut-off events. [2025-01-10 06:56:17,764 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-01-10 06:56:17,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8221 conditions, 4708 events. 2303/4708 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 34374 event pairs, 1652 based on Foata normal form. 2/3558 useless extension candidates. Maximal degree in co-relation 8168. Up to 3075 conditions per place. [2025-01-10 06:56:17,784 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 54 selfloop transitions, 40 changer transitions 0/137 dead transitions. [2025-01-10 06:56:17,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 909 flow [2025-01-10 06:56:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:56:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:56:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 294 transitions. [2025-01-10 06:56:17,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-01-10 06:56:17,786 INFO L175 Difference]: Start difference. First operand has 141 places, 139 transitions, 741 flow. Second operand 5 states and 294 transitions. [2025-01-10 06:56:17,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 909 flow [2025-01-10 06:56:17,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 137 transitions, 849 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 06:56:17,789 INFO L231 Difference]: Finished difference. Result has 135 places, 137 transitions, 741 flow [2025-01-10 06:56:17,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=741, PETRI_PLACES=135, PETRI_TRANSITIONS=137} [2025-01-10 06:56:17,791 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 35 predicate places. [2025-01-10 06:56:17,791 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 137 transitions, 741 flow [2025-01-10 06:56:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 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-10 06:56:17,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:17,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:17,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:56:17,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:17,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:17,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1654979838, now seen corresponding path program 1 times [2025-01-10 06:56:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494950989] [2025-01-10 06:56:17,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:18,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:56:18,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:56:18,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:18,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:56:18,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:18,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494950989] [2025-01-10 06:56:18,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494950989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:18,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:18,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:56:18,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224946635] [2025-01-10 06:56:18,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:18,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:18,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:18,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:18,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2025-01-10 06:56:18,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 137 transitions, 741 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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-10 06:56:18,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:18,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2025-01-10 06:56:18,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:18,666 INFO L124 PetriNetUnfolderBase]: 4945/8346 cut-off events. [2025-01-10 06:56:18,666 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2025-01-10 06:56:18,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15438 conditions, 8346 events. 4945/8346 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 57920 event pairs, 2526 based on Foata normal form. 244/6322 useless extension candidates. Maximal degree in co-relation 15392. Up to 5080 conditions per place. [2025-01-10 06:56:18,698 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 133 selfloop transitions, 4 changer transitions 0/178 dead transitions. [2025-01-10 06:56:18,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 178 transitions, 1101 flow [2025-01-10 06:56:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 304 transitions. [2025-01-10 06:56:18,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2025-01-10 06:56:18,700 INFO L175 Difference]: Start difference. First operand has 135 places, 137 transitions, 741 flow. Second operand 4 states and 304 transitions. [2025-01-10 06:56:18,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 178 transitions, 1101 flow [2025-01-10 06:56:18,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 178 transitions, 1026 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:18,704 INFO L231 Difference]: Finished difference. Result has 137 places, 140 transitions, 695 flow [2025-01-10 06:56:18,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=695, PETRI_PLACES=137, PETRI_TRANSITIONS=140} [2025-01-10 06:56:18,704 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 37 predicate places. [2025-01-10 06:56:18,704 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 140 transitions, 695 flow [2025-01-10 06:56:18,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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-10 06:56:18,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:18,705 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-10 06:56:18,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:56:18,705 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:18,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1387060442, now seen corresponding path program 1 times [2025-01-10 06:56:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:18,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822293828] [2025-01-10 06:56:18,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:18,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:56:18,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:56:18,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:18,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:56:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:18,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822293828] [2025-01-10 06:56:18,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822293828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:18,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:18,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:56:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571597586] [2025-01-10 06:56:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:18,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:56:18,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:18,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:56:18,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:56:18,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2025-01-10 06:56:18,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 140 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:18,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:18,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2025-01-10 06:56:18,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:19,598 INFO L124 PetriNetUnfolderBase]: 6023/10884 cut-off events. [2025-01-10 06:56:19,599 INFO L125 PetriNetUnfolderBase]: For 3837/4177 co-relation queries the response was YES. [2025-01-10 06:56:19,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23277 conditions, 10884 events. 6023/10884 cut-off events. For 3837/4177 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 82886 event pairs, 2568 based on Foata normal form. 0/8344 useless extension candidates. Maximal degree in co-relation 23229. Up to 4974 conditions per place. [2025-01-10 06:56:19,648 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 116 selfloop transitions, 3 changer transitions 0/162 dead transitions. [2025-01-10 06:56:19,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 162 transitions, 998 flow [2025-01-10 06:56:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:56:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:56:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2025-01-10 06:56:19,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7396825396825397 [2025-01-10 06:56:19,650 INFO L175 Difference]: Start difference. First operand has 137 places, 140 transitions, 695 flow. Second operand 3 states and 233 transitions. [2025-01-10 06:56:19,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 162 transitions, 998 flow [2025-01-10 06:56:19,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 162 transitions, 992 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:56:19,656 INFO L231 Difference]: Finished difference. Result has 139 places, 142 transitions, 713 flow [2025-01-10 06:56:19,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=139, PETRI_TRANSITIONS=142} [2025-01-10 06:56:19,656 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 39 predicate places. [2025-01-10 06:56:19,656 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 142 transitions, 713 flow [2025-01-10 06:56:19,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:19,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:19,657 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-10 06:56:19,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:56:19,657 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:19,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1387060447, now seen corresponding path program 1 times [2025-01-10 06:56:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:19,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685817587] [2025-01-10 06:56:19,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:19,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:56:19,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:56:19,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:19,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685817587] [2025-01-10 06:56:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685817587] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086803108] [2025-01-10 06:56:19,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:19,732 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:19,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:56:19,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:56:19,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:56:19,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:19,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:19,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:56:19,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:19,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086803108] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:19,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:19,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 06:56:19,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547204950] [2025-01-10 06:56:19,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:19,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:56:19,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:19,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:56:19,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:56:20,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-01-10 06:56:20,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 142 transitions, 713 flow. Second operand has 15 states, 15 states have (on average 50.06666666666667) internal successors, (751), 15 states have internal predecessors, (751), 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-10 06:56:20,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:20,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-01-10 06:56:20,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:20,709 INFO L124 PetriNetUnfolderBase]: 3768/7290 cut-off events. [2025-01-10 06:56:20,709 INFO L125 PetriNetUnfolderBase]: For 2714/3049 co-relation queries the response was YES. [2025-01-10 06:56:20,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15340 conditions, 7290 events. 3768/7290 cut-off events. For 2714/3049 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 51958 event pairs, 2538 based on Foata normal form. 77/5946 useless extension candidates. Maximal degree in co-relation 15291. Up to 4264 conditions per place. [2025-01-10 06:56:20,743 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 110 selfloop transitions, 45 changer transitions 0/197 dead transitions. [2025-01-10 06:56:20,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 197 transitions, 1244 flow [2025-01-10 06:56:20,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:56:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:56:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 639 transitions. [2025-01-10 06:56:20,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5532467532467532 [2025-01-10 06:56:20,744 INFO L175 Difference]: Start difference. First operand has 139 places, 142 transitions, 713 flow. Second operand 11 states and 639 transitions. [2025-01-10 06:56:20,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 197 transitions, 1244 flow [2025-01-10 06:56:20,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 197 transitions, 1239 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:56:20,751 INFO L231 Difference]: Finished difference. Result has 150 places, 144 transitions, 820 flow [2025-01-10 06:56:20,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=820, PETRI_PLACES=150, PETRI_TRANSITIONS=144} [2025-01-10 06:56:20,751 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 50 predicate places. [2025-01-10 06:56:20,752 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 144 transitions, 820 flow [2025-01-10 06:56:20,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 50.06666666666667) internal successors, (751), 15 states have internal predecessors, (751), 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-10 06:56:20,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:20,752 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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-10 06:56:20,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 06:56:20,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:20,953 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:20,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:20,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1573695725, now seen corresponding path program 1 times [2025-01-10 06:56:20,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:20,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183479242] [2025-01-10 06:56:20,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:20,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:20,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:56:20,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:56:20,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:20,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:56:21,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:21,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183479242] [2025-01-10 06:56:21,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183479242] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:21,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463814264] [2025-01-10 06:56:21,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:21,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:21,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:21,054 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:21,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:56:21,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:56:21,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:56:21,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:21,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:21,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:56:21,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:56:21,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:56:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463814264] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:21,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 06:56:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468268536] [2025-01-10 06:56:21,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:21,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:56:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:21,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:56:21,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:56:21,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:21,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 144 transitions, 820 flow. Second operand has 15 states, 15 states have (on average 51.0) internal successors, (765), 15 states have internal predecessors, (765), 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-10 06:56:21,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:21,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:21,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:21,938 INFO L124 PetriNetUnfolderBase]: 3164/6335 cut-off events. [2025-01-10 06:56:21,938 INFO L125 PetriNetUnfolderBase]: For 2804/2925 co-relation queries the response was YES. [2025-01-10 06:56:21,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13471 conditions, 6335 events. 3164/6335 cut-off events. For 2804/2925 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 49067 event pairs, 2174 based on Foata normal form. 38/5107 useless extension candidates. Maximal degree in co-relation 13420. Up to 3850 conditions per place. [2025-01-10 06:56:21,970 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 100 selfloop transitions, 45 changer transitions 0/188 dead transitions. [2025-01-10 06:56:21,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 188 transitions, 1287 flow [2025-01-10 06:56:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:56:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:56:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 646 transitions. [2025-01-10 06:56:21,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5593073593073593 [2025-01-10 06:56:21,972 INFO L175 Difference]: Start difference. First operand has 150 places, 144 transitions, 820 flow. Second operand 11 states and 646 transitions. [2025-01-10 06:56:21,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 188 transitions, 1287 flow [2025-01-10 06:56:21,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 188 transitions, 1203 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 06:56:21,981 INFO L231 Difference]: Finished difference. Result has 154 places, 146 transitions, 846 flow [2025-01-10 06:56:21,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=846, PETRI_PLACES=154, PETRI_TRANSITIONS=146} [2025-01-10 06:56:21,981 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 54 predicate places. [2025-01-10 06:56:21,981 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 146 transitions, 846 flow [2025-01-10 06:56:21,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 51.0) internal successors, (765), 15 states have internal predecessors, (765), 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-10 06:56:21,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:21,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:21,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 06:56:22,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 06:56:22,183 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:22,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1409257645, now seen corresponding path program 1 times [2025-01-10 06:56:22,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:22,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465189972] [2025-01-10 06:56:22,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:22,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:22,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:56:22,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:56:22,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:22,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:56:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465189972] [2025-01-10 06:56:22,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465189972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:22,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:22,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:56:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674958650] [2025-01-10 06:56:22,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:22,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:22,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:22,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:22,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:22,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-01-10 06:56:22,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 146 transitions, 846 flow. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-10 06:56:22,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:22,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-01-10 06:56:22,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:23,542 INFO L124 PetriNetUnfolderBase]: 7309/12773 cut-off events. [2025-01-10 06:56:23,542 INFO L125 PetriNetUnfolderBase]: For 9394/9804 co-relation queries the response was YES. [2025-01-10 06:56:23,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30199 conditions, 12773 events. 7309/12773 cut-off events. For 9394/9804 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 94361 event pairs, 3698 based on Foata normal form. 231/10511 useless extension candidates. Maximal degree in co-relation 30112. Up to 6584 conditions per place. [2025-01-10 06:56:23,635 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 168 selfloop transitions, 3 changer transitions 0/211 dead transitions. [2025-01-10 06:56:23,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 211 transitions, 1473 flow [2025-01-10 06:56:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 304 transitions. [2025-01-10 06:56:23,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2025-01-10 06:56:23,637 INFO L175 Difference]: Start difference. First operand has 154 places, 146 transitions, 846 flow. Second operand 4 states and 304 transitions. [2025-01-10 06:56:23,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 211 transitions, 1473 flow [2025-01-10 06:56:23,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 211 transitions, 1389 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 06:56:23,664 INFO L231 Difference]: Finished difference. Result has 151 places, 148 transitions, 784 flow [2025-01-10 06:56:23,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=784, PETRI_PLACES=151, PETRI_TRANSITIONS=148} [2025-01-10 06:56:23,665 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 51 predicate places. [2025-01-10 06:56:23,665 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 148 transitions, 784 flow [2025-01-10 06:56:23,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-10 06:56:23,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:23,665 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:23,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:56:23,665 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:23,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:23,665 INFO L85 PathProgramCache]: Analyzing trace with hash 284098108, now seen corresponding path program 2 times [2025-01-10 06:56:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:23,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229705056] [2025-01-10 06:56:23,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:23,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 06:56:23,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:23,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:56:23,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:56:24,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229705056] [2025-01-10 06:56:24,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229705056] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547804570] [2025-01-10 06:56:24,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:24,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:24,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:24,068 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:24,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:56:24,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 06:56:24,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:24,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:56:24,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:24,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 06:56:24,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:24,188 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-10 06:56:24,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:24,276 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:24,277 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-10 06:56:24,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:24,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:56:24,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:24,419 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_384) c_~B~0.base) (+ 4 c_~B~0.offset)) 9223372039002259456))) is different from false [2025-01-10 06:56:24,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:24,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-01-10 06:56:24,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:24,474 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 43 treesize of output 37 [2025-01-10 06:56:24,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-10 06:56:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2025-01-10 06:56:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547804570] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:24,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:24,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 24 [2025-01-10 06:56:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716375930] [2025-01-10 06:56:24,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:24,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 06:56:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:24,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 06:56:24,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=477, Unknown=1, NotChecked=44, Total=600 [2025-01-10 06:56:24,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-01-10 06:56:24,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 148 transitions, 784 flow. Second operand has 25 states, 25 states have (on average 47.2) internal successors, (1180), 25 states have internal predecessors, (1180), 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-10 06:56:24,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:24,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-01-10 06:56:24,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:25,917 INFO L124 PetriNetUnfolderBase]: 5903/10124 cut-off events. [2025-01-10 06:56:25,917 INFO L125 PetriNetUnfolderBase]: For 9563/10530 co-relation queries the response was YES. [2025-01-10 06:56:25,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26221 conditions, 10124 events. 5903/10124 cut-off events. For 9563/10530 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 68935 event pairs, 1507 based on Foata normal form. 200/8593 useless extension candidates. Maximal degree in co-relation 26098. Up to 2739 conditions per place. [2025-01-10 06:56:25,987 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 165 selfloop transitions, 43 changer transitions 0/247 dead transitions. [2025-01-10 06:56:25,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 247 transitions, 1611 flow [2025-01-10 06:56:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 06:56:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 06:56:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 853 transitions. [2025-01-10 06:56:25,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5077380952380952 [2025-01-10 06:56:25,988 INFO L175 Difference]: Start difference. First operand has 151 places, 148 transitions, 784 flow. Second operand 16 states and 853 transitions. [2025-01-10 06:56:25,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 247 transitions, 1611 flow [2025-01-10 06:56:25,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 247 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:56:26,000 INFO L231 Difference]: Finished difference. Result has 167 places, 154 transitions, 927 flow [2025-01-10 06:56:26,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=927, PETRI_PLACES=167, PETRI_TRANSITIONS=154} [2025-01-10 06:56:26,000 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 67 predicate places. [2025-01-10 06:56:26,000 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 154 transitions, 927 flow [2025-01-10 06:56:26,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 47.2) internal successors, (1180), 25 states have internal predecessors, (1180), 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-10 06:56:26,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:26,001 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:26,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 06:56:26,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:26,201 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:26,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 284098109, now seen corresponding path program 1 times [2025-01-10 06:56:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:26,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433226771] [2025-01-10 06:56:26,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:26,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:26,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:26,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:26,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:26,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:26,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433226771] [2025-01-10 06:56:26,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433226771] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:26,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180597701] [2025-01-10 06:56:26,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:26,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:26,601 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:26,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 06:56:26,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:26,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:26,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:26,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:26,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 06:56:26,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:26,726 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-10 06:56:26,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 06:56:26,808 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:26,809 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-10 06:56:26,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:26,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:56:26,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:26,933 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_425 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_425) c_~B~0.base) (+ 4 c_~B~0.offset)) 4294967296)) is different from false [2025-01-10 06:56:26,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:26,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-01-10 06:56:26,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:26,983 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 37 treesize of output 31 [2025-01-10 06:56:26,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:56:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2025-01-10 06:56:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180597701] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:27,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:27,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-01-10 06:56:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393596440] [2025-01-10 06:56:27,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:27,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 06:56:27,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:27,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 06:56:27,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=522, Unknown=1, NotChecked=46, Total=650 [2025-01-10 06:56:27,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-01-10 06:56:27,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 154 transitions, 927 flow. Second operand has 26 states, 26 states have (on average 47.11538461538461) internal successors, (1225), 26 states have internal predecessors, (1225), 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-10 06:56:27,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:27,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-01-10 06:56:27,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:28,428 INFO L124 PetriNetUnfolderBase]: 5571/9320 cut-off events. [2025-01-10 06:56:28,429 INFO L125 PetriNetUnfolderBase]: For 11119/12168 co-relation queries the response was YES. [2025-01-10 06:56:28,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27177 conditions, 9320 events. 5571/9320 cut-off events. For 11119/12168 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 61681 event pairs, 1461 based on Foata normal form. 224/8251 useless extension candidates. Maximal degree in co-relation 27052. Up to 2569 conditions per place. [2025-01-10 06:56:28,487 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 148 selfloop transitions, 43 changer transitions 0/230 dead transitions. [2025-01-10 06:56:28,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 230 transitions, 1622 flow [2025-01-10 06:56:28,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:56:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:56:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 796 transitions. [2025-01-10 06:56:28,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5053968253968254 [2025-01-10 06:56:28,489 INFO L175 Difference]: Start difference. First operand has 167 places, 154 transitions, 927 flow. Second operand 15 states and 796 transitions. [2025-01-10 06:56:28,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 230 transitions, 1622 flow [2025-01-10 06:56:28,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 230 transitions, 1571 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-10 06:56:28,501 INFO L231 Difference]: Finished difference. Result has 175 places, 153 transitions, 958 flow [2025-01-10 06:56:28,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=958, PETRI_PLACES=175, PETRI_TRANSITIONS=153} [2025-01-10 06:56:28,501 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 75 predicate places. [2025-01-10 06:56:28,501 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 153 transitions, 958 flow [2025-01-10 06:56:28,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 47.11538461538461) internal successors, (1225), 26 states have internal predecessors, (1225), 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-10 06:56:28,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:28,502 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:28,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 06:56:28,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:28,706 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:28,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash 284098111, now seen corresponding path program 1 times [2025-01-10 06:56:28,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:28,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12234747] [2025-01-10 06:56:28,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:28,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:28,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:28,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:28,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:28,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:29,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:29,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12234747] [2025-01-10 06:56:29,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12234747] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:29,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888856104] [2025-01-10 06:56:29,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:29,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:29,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:29,049 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:29,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 06:56:29,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:29,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:29,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:29,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:29,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 06:56:29,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:29,158 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-10 06:56:29,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 06:56:29,225 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:56:29,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 06:56:29,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-10 06:56:29,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-10 06:56:29,292 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:29,293 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-10 06:56:29,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-10 06:56:29,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-10 06:56:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:29,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:29,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:29,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-01-10 06:56:29,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:29,587 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 81 treesize of output 75 [2025-01-10 06:56:29,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-01-10 06:56:29,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2025-01-10 06:56:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:29,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888856104] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:29,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:29,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-01-10 06:56:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346224471] [2025-01-10 06:56:29,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:29,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 06:56:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:29,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 06:56:29,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=514, Unknown=4, NotChecked=0, Total=600 [2025-01-10 06:56:34,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:56:34,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-01-10 06:56:34,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 153 transitions, 958 flow. Second operand has 25 states, 25 states have (on average 46.72) internal successors, (1168), 25 states have internal predecessors, (1168), 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-10 06:56:34,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:34,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-01-10 06:56:34,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:35,922 INFO L124 PetriNetUnfolderBase]: 5677/9974 cut-off events. [2025-01-10 06:56:35,922 INFO L125 PetriNetUnfolderBase]: For 14032/14927 co-relation queries the response was YES. [2025-01-10 06:56:35,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29476 conditions, 9974 events. 5677/9974 cut-off events. For 14032/14927 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 69030 event pairs, 2729 based on Foata normal form. 184/8869 useless extension candidates. Maximal degree in co-relation 29317. Up to 4890 conditions per place. [2025-01-10 06:56:36,172 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 154 selfloop transitions, 42 changer transitions 0/235 dead transitions. [2025-01-10 06:56:36,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 235 transitions, 1724 flow [2025-01-10 06:56:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:56:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:56:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 799 transitions. [2025-01-10 06:56:36,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5073015873015873 [2025-01-10 06:56:36,174 INFO L175 Difference]: Start difference. First operand has 175 places, 153 transitions, 958 flow. Second operand 15 states and 799 transitions. [2025-01-10 06:56:36,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 235 transitions, 1724 flow [2025-01-10 06:56:36,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 235 transitions, 1646 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-01-10 06:56:36,186 INFO L231 Difference]: Finished difference. Result has 178 places, 157 transitions, 1043 flow [2025-01-10 06:56:36,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1043, PETRI_PLACES=178, PETRI_TRANSITIONS=157} [2025-01-10 06:56:36,187 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 78 predicate places. [2025-01-10 06:56:36,187 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 157 transitions, 1043 flow [2025-01-10 06:56:36,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 46.72) internal successors, (1168), 25 states have internal predecessors, (1168), 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-10 06:56:36,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:36,187 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:36,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 06:56:36,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:36,392 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:36,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash 284098112, now seen corresponding path program 1 times [2025-01-10 06:56:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:36,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37436463] [2025-01-10 06:56:36,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:36,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:36,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:36,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:36,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:36,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:36,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:36,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37436463] [2025-01-10 06:56:36,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37436463] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:36,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785224826] [2025-01-10 06:56:36,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:36,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:36,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:36,731 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:36,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 06:56:36,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:36,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:36,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:36,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:36,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 06:56:36,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:36,875 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-10 06:56:36,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 06:56:36,917 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:56:36,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 06:56:36,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:36,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:36,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:36,963 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-10 06:56:36,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:36,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:37,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:37,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:37,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-01-10 06:56:37,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:37,213 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 141 treesize of output 129 [2025-01-10 06:56:37,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-01-10 06:56:37,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-01-10 06:56:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785224826] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:37,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:37,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-01-10 06:56:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917805399] [2025-01-10 06:56:37,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:37,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:56:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:37,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:56:37,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=288, Unknown=3, NotChecked=0, Total=342 [2025-01-10 06:56:37,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-01-10 06:56:37,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 157 transitions, 1043 flow. Second operand has 19 states, 19 states have (on average 46.78947368421053) internal successors, (889), 19 states have internal predecessors, (889), 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-10 06:56:37,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:37,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-01-10 06:56:37,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:39,339 INFO L124 PetriNetUnfolderBase]: 5413/9607 cut-off events. [2025-01-10 06:56:39,339 INFO L125 PetriNetUnfolderBase]: For 17831/18681 co-relation queries the response was YES. [2025-01-10 06:56:39,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28919 conditions, 9607 events. 5413/9607 cut-off events. For 17831/18681 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 66451 event pairs, 2690 based on Foata normal form. 171/8724 useless extension candidates. Maximal degree in co-relation 28758. Up to 4890 conditions per place. [2025-01-10 06:56:39,384 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 153 selfloop transitions, 42 changer transitions 0/234 dead transitions. [2025-01-10 06:56:39,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 234 transitions, 1748 flow [2025-01-10 06:56:39,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:56:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:56:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 798 transitions. [2025-01-10 06:56:39,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2025-01-10 06:56:39,386 INFO L175 Difference]: Start difference. First operand has 178 places, 157 transitions, 1043 flow. Second operand 15 states and 798 transitions. [2025-01-10 06:56:39,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 234 transitions, 1748 flow [2025-01-10 06:56:39,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 234 transitions, 1704 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:56:39,398 INFO L231 Difference]: Finished difference. Result has 188 places, 156 transitions, 1079 flow [2025-01-10 06:56:39,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1079, PETRI_PLACES=188, PETRI_TRANSITIONS=156} [2025-01-10 06:56:39,398 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 88 predicate places. [2025-01-10 06:56:39,398 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 156 transitions, 1079 flow [2025-01-10 06:56:39,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 46.78947368421053) internal successors, (889), 19 states have internal predecessors, (889), 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-10 06:56:39,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:39,399 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:39,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 06:56:39,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 06:56:39,600 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:39,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1307388072, now seen corresponding path program 2 times [2025-01-10 06:56:39,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:39,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622122186] [2025-01-10 06:56:39,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:39,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:39,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 06:56:39,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:56:39,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:56:39,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:39,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:39,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622122186] [2025-01-10 06:56:39,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622122186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:39,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:56:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661151203] [2025-01-10 06:56:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:39,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:56:39,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:39,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:56:39,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:56:39,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-01-10 06:56:39,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 156 transitions, 1079 flow. Second operand has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 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-10 06:56:39,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:39,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-01-10 06:56:39,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:40,465 INFO L124 PetriNetUnfolderBase]: 5779/9618 cut-off events. [2025-01-10 06:56:40,466 INFO L125 PetriNetUnfolderBase]: For 25791/26512 co-relation queries the response was YES. [2025-01-10 06:56:40,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31342 conditions, 9618 events. 5779/9618 cut-off events. For 25791/26512 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 65100 event pairs, 1304 based on Foata normal form. 415/9018 useless extension candidates. Maximal degree in co-relation 31181. Up to 3400 conditions per place. [2025-01-10 06:56:40,540 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 157 selfloop transitions, 9 changer transitions 0/207 dead transitions. [2025-01-10 06:56:40,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 207 transitions, 1763 flow [2025-01-10 06:56:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 296 transitions. [2025-01-10 06:56:40,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2025-01-10 06:56:40,541 INFO L175 Difference]: Start difference. First operand has 188 places, 156 transitions, 1079 flow. Second operand 4 states and 296 transitions. [2025-01-10 06:56:40,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 207 transitions, 1763 flow [2025-01-10 06:56:40,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 207 transitions, 1683 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-01-10 06:56:40,559 INFO L231 Difference]: Finished difference. Result has 178 places, 155 transitions, 1023 flow [2025-01-10 06:56:40,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1023, PETRI_PLACES=178, PETRI_TRANSITIONS=155} [2025-01-10 06:56:40,560 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 78 predicate places. [2025-01-10 06:56:40,560 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 155 transitions, 1023 flow [2025-01-10 06:56:40,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 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-10 06:56:40,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:40,560 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:40,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:56:40,560 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:40,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:40,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1859584572, now seen corresponding path program 1 times [2025-01-10 06:56:40,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916127302] [2025-01-10 06:56:40,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:40,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:56:40,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:56:40,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:40,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:40,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916127302] [2025-01-10 06:56:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916127302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:40,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:40,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:56:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666658414] [2025-01-10 06:56:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:40,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:40,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:40,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:40,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-01-10 06:56:40,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 155 transitions, 1023 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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-10 06:56:40,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:40,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-01-10 06:56:40,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:41,413 INFO L124 PetriNetUnfolderBase]: 5487/9904 cut-off events. [2025-01-10 06:56:41,413 INFO L125 PetriNetUnfolderBase]: For 26123/26698 co-relation queries the response was YES. [2025-01-10 06:56:41,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31666 conditions, 9904 events. 5487/9904 cut-off events. For 26123/26698 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 69622 event pairs, 2860 based on Foata normal form. 367/9559 useless extension candidates. Maximal degree in co-relation 31505. Up to 6010 conditions per place. [2025-01-10 06:56:41,490 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 140 selfloop transitions, 10 changer transitions 0/190 dead transitions. [2025-01-10 06:56:41,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 190 transitions, 1497 flow [2025-01-10 06:56:41,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 288 transitions. [2025-01-10 06:56:41,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-01-10 06:56:41,491 INFO L175 Difference]: Start difference. First operand has 178 places, 155 transitions, 1023 flow. Second operand 4 states and 288 transitions. [2025-01-10 06:56:41,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 190 transitions, 1497 flow [2025-01-10 06:56:41,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 190 transitions, 1447 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:41,509 INFO L231 Difference]: Finished difference. Result has 180 places, 156 transitions, 1044 flow [2025-01-10 06:56:41,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1044, PETRI_PLACES=180, PETRI_TRANSITIONS=156} [2025-01-10 06:56:41,510 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 80 predicate places. [2025-01-10 06:56:41,510 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 156 transitions, 1044 flow [2025-01-10 06:56:41,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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-10 06:56:41,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:41,511 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:41,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:56:41,511 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:41,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1874323493, now seen corresponding path program 1 times [2025-01-10 06:56:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:41,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429320156] [2025-01-10 06:56:41,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:41,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:41,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:56:41,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:56:41,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:41,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:41,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:41,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429320156] [2025-01-10 06:56:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429320156] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:41,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784153541] [2025-01-10 06:56:41,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:41,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:41,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:41,571 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:41,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 06:56:41,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:56:41,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:56:41,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:41,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:41,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:56:41,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:41,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:41,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784153541] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:41,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:41,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:56:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357451800] [2025-01-10 06:56:41,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:41,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:56:41,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:41,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:56:41,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:56:41,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2025-01-10 06:56:41,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 156 transitions, 1044 flow. Second operand has 12 states, 12 states have (on average 55.25) internal successors, (663), 12 states have internal predecessors, (663), 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-10 06:56:41,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:41,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2025-01-10 06:56:41,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:43,192 INFO L124 PetriNetUnfolderBase]: 8252/13386 cut-off events. [2025-01-10 06:56:43,193 INFO L125 PetriNetUnfolderBase]: For 38757/39847 co-relation queries the response was YES. [2025-01-10 06:56:43,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44668 conditions, 13386 events. 8252/13386 cut-off events. For 38757/39847 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 91211 event pairs, 2501 based on Foata normal form. 321/12264 useless extension candidates. Maximal degree in co-relation 44505. Up to 5596 conditions per place. [2025-01-10 06:56:43,311 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 297 selfloop transitions, 15 changer transitions 0/355 dead transitions. [2025-01-10 06:56:43,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 355 transitions, 2932 flow [2025-01-10 06:56:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:56:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:56:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 745 transitions. [2025-01-10 06:56:43,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7095238095238096 [2025-01-10 06:56:43,313 INFO L175 Difference]: Start difference. First operand has 180 places, 156 transitions, 1044 flow. Second operand 10 states and 745 transitions. [2025-01-10 06:56:43,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 355 transitions, 2932 flow [2025-01-10 06:56:43,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 355 transitions, 2893 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:56:43,340 INFO L231 Difference]: Finished difference. Result has 191 places, 165 transitions, 1119 flow [2025-01-10 06:56:43,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1119, PETRI_PLACES=191, PETRI_TRANSITIONS=165} [2025-01-10 06:56:43,340 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 91 predicate places. [2025-01-10 06:56:43,340 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 165 transitions, 1119 flow [2025-01-10 06:56:43,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 55.25) internal successors, (663), 12 states have internal predecessors, (663), 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-10 06:56:43,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:43,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:43,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 06:56:43,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-10 06:56:43,542 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:43,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash 962386623, now seen corresponding path program 1 times [2025-01-10 06:56:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189067417] [2025-01-10 06:56:43,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:43,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:56:43,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:56:43,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:43,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:56:43,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:43,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189067417] [2025-01-10 06:56:43,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189067417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:43,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:43,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:56:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716421942] [2025-01-10 06:56:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:43,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:56:43,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:43,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:56:43,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:56:43,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-01-10 06:56:43,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 165 transitions, 1119 flow. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 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-10 06:56:43,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:43,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-01-10 06:56:43,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:46,491 INFO L124 PetriNetUnfolderBase]: 15559/26218 cut-off events. [2025-01-10 06:56:46,491 INFO L125 PetriNetUnfolderBase]: For 83501/85475 co-relation queries the response was YES. [2025-01-10 06:56:46,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93846 conditions, 26218 events. 15559/26218 cut-off events. For 83501/85475 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 206395 event pairs, 11924 based on Foata normal form. 606/25449 useless extension candidates. Maximal degree in co-relation 93616. Up to 10756 conditions per place. [2025-01-10 06:56:46,757 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 172 selfloop transitions, 17 changer transitions 0/226 dead transitions. [2025-01-10 06:56:46,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 226 transitions, 1915 flow [2025-01-10 06:56:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:56:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:56:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 313 transitions. [2025-01-10 06:56:46,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5961904761904762 [2025-01-10 06:56:46,758 INFO L175 Difference]: Start difference. First operand has 191 places, 165 transitions, 1119 flow. Second operand 5 states and 313 transitions. [2025-01-10 06:56:46,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 226 transitions, 1915 flow [2025-01-10 06:56:46,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 226 transitions, 1847 flow, removed 22 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:46,887 INFO L231 Difference]: Finished difference. Result has 195 places, 170 transitions, 1175 flow [2025-01-10 06:56:46,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1175, PETRI_PLACES=195, PETRI_TRANSITIONS=170} [2025-01-10 06:56:46,888 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 95 predicate places. [2025-01-10 06:56:46,888 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 170 transitions, 1175 flow [2025-01-10 06:56:46,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 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-10 06:56:46,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:46,888 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:46,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:56:46,888 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:46,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:46,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1900250533, now seen corresponding path program 1 times [2025-01-10 06:56:46,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:46,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233543880] [2025-01-10 06:56:46,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:46,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:56:46,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:56:46,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:46,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 06:56:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233543880] [2025-01-10 06:56:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233543880] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668437202] [2025-01-10 06:56:47,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:47,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:47,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:47,006 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:47,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 06:56:47,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:56:47,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:56:47,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:47,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:47,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:56:47,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 06:56:47,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 06:56:47,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668437202] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:47,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:47,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-01-10 06:56:47,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95176372] [2025-01-10 06:56:47,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:47,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 06:56:47,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:47,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 06:56:47,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-01-10 06:56:47,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 105 [2025-01-10 06:56:47,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 170 transitions, 1175 flow. Second operand has 26 states, 26 states have (on average 46.84615384615385) internal successors, (1218), 26 states have internal predecessors, (1218), 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-10 06:56:47,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:47,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 105 [2025-01-10 06:56:47,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:53,339 INFO L124 PetriNetUnfolderBase]: 30185/48428 cut-off events. [2025-01-10 06:56:53,339 INFO L125 PetriNetUnfolderBase]: For 117524/120646 co-relation queries the response was YES. [2025-01-10 06:56:53,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156537 conditions, 48428 events. 30185/48428 cut-off events. For 117524/120646 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 372700 event pairs, 17808 based on Foata normal form. 1438/47592 useless extension candidates. Maximal degree in co-relation 156254. Up to 27416 conditions per place. [2025-01-10 06:56:53,735 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 206 selfloop transitions, 86 changer transitions 0/333 dead transitions. [2025-01-10 06:56:53,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 333 transitions, 2692 flow [2025-01-10 06:56:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 06:56:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 06:56:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1068 transitions. [2025-01-10 06:56:53,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286 [2025-01-10 06:56:53,737 INFO L175 Difference]: Start difference. First operand has 195 places, 170 transitions, 1175 flow. Second operand 20 states and 1068 transitions. [2025-01-10 06:56:53,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 333 transitions, 2692 flow [2025-01-10 06:56:53,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 333 transitions, 2683 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:56:53,974 INFO L231 Difference]: Finished difference. Result has 219 places, 203 transitions, 1743 flow [2025-01-10 06:56:53,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1743, PETRI_PLACES=219, PETRI_TRANSITIONS=203} [2025-01-10 06:56:53,975 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 119 predicate places. [2025-01-10 06:56:53,975 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 203 transitions, 1743 flow [2025-01-10 06:56:53,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 46.84615384615385) internal successors, (1218), 26 states have internal predecessors, (1218), 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-10 06:56:53,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:53,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:53,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 06:56:54,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 06:56:54,176 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:54,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:54,177 INFO L85 PathProgramCache]: Analyzing trace with hash -720364783, now seen corresponding path program 1 times [2025-01-10 06:56:54,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:54,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66953580] [2025-01-10 06:56:54,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:54,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:54,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:56:54,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:56:54,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:54,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:56:54,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66953580] [2025-01-10 06:56:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66953580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:54,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:54,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:56:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027252054] [2025-01-10 06:56:54,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:54,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:56:54,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:54,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:56:54,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:56:54,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-01-10 06:56:54,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 203 transitions, 1743 flow. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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-10 06:56:54,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:54,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-01-10 06:56:54,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:58,997 INFO L124 PetriNetUnfolderBase]: 25072/42427 cut-off events. [2025-01-10 06:56:58,997 INFO L125 PetriNetUnfolderBase]: For 184946/188938 co-relation queries the response was YES. [2025-01-10 06:56:59,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154102 conditions, 42427 events. 25072/42427 cut-off events. For 184946/188938 co-relation queries the response was YES. Maximal size of possible extension queue 1183. Compared 352706 event pairs, 7764 based on Foata normal form. 1285/41802 useless extension candidates. Maximal degree in co-relation 153610. Up to 25828 conditions per place. [2025-01-10 06:56:59,338 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 192 selfloop transitions, 32 changer transitions 0/261 dead transitions. [2025-01-10 06:56:59,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 261 transitions, 2662 flow [2025-01-10 06:56:59,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:56:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:56:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2025-01-10 06:56:59,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5360544217687074 [2025-01-10 06:56:59,339 INFO L175 Difference]: Start difference. First operand has 219 places, 203 transitions, 1743 flow. Second operand 7 states and 394 transitions. [2025-01-10 06:56:59,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 261 transitions, 2662 flow [2025-01-10 06:56:59,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 261 transitions, 2577 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 06:56:59,789 INFO L231 Difference]: Finished difference. Result has 227 places, 214 transitions, 1866 flow [2025-01-10 06:56:59,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1866, PETRI_PLACES=227, PETRI_TRANSITIONS=214} [2025-01-10 06:56:59,791 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 127 predicate places. [2025-01-10 06:56:59,791 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 214 transitions, 1866 flow [2025-01-10 06:56:59,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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-10 06:56:59,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:59,791 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:59,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:56:59,792 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:59,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash -820672626, now seen corresponding path program 1 times [2025-01-10 06:56:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989578759] [2025-01-10 06:56:59,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:59,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:59,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:56:59,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:56:59,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:59,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 06:56:59,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:59,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989578759] [2025-01-10 06:56:59,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989578759] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:59,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909139139] [2025-01-10 06:56:59,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:59,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:59,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:59,863 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:59,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 06:56:59,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:56:59,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:56:59,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:59,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:59,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:56:59,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 06:57:00,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 06:57:00,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909139139] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:00,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:00,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 06:57:00,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740584555] [2025-01-10 06:57:00,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:00,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:57:00,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:00,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:57:00,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:57:00,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-01-10 06:57:00,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 214 transitions, 1866 flow. Second operand has 15 states, 15 states have (on average 50.333333333333336) internal successors, (755), 15 states have internal predecessors, (755), 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-10 06:57:00,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:00,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-01-10 06:57:00,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:06,060 INFO L124 PetriNetUnfolderBase]: 29336/48978 cut-off events. [2025-01-10 06:57:06,061 INFO L125 PetriNetUnfolderBase]: For 212609/216110 co-relation queries the response was YES. [2025-01-10 06:57:06,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175944 conditions, 48978 events. 29336/48978 cut-off events. For 212609/216110 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 398436 event pairs, 17296 based on Foata normal form. 1267/45942 useless extension candidates. Maximal degree in co-relation 175574. Up to 30405 conditions per place. [2025-01-10 06:57:06,588 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 177 selfloop transitions, 71 changer transitions 0/298 dead transitions. [2025-01-10 06:57:06,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 298 transitions, 3030 flow [2025-01-10 06:57:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:57:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:57:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 695 transitions. [2025-01-10 06:57:06,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515873015873016 [2025-01-10 06:57:06,590 INFO L175 Difference]: Start difference. First operand has 227 places, 214 transitions, 1866 flow. Second operand 12 states and 695 transitions. [2025-01-10 06:57:06,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 298 transitions, 3030 flow [2025-01-10 06:57:06,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 298 transitions, 3022 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:06,929 INFO L231 Difference]: Finished difference. Result has 240 places, 216 transitions, 2066 flow [2025-01-10 06:57:06,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2066, PETRI_PLACES=240, PETRI_TRANSITIONS=216} [2025-01-10 06:57:06,930 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 140 predicate places. [2025-01-10 06:57:06,930 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 216 transitions, 2066 flow [2025-01-10 06:57:06,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 50.333333333333336) internal successors, (755), 15 states have internal predecessors, (755), 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-10 06:57:06,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:06,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:06,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 06:57:07,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:07,135 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:57:07,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash -383837174, now seen corresponding path program 1 times [2025-01-10 06:57:07,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:07,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546725421] [2025-01-10 06:57:07,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:07,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:07,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:57:07,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:57:07,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:07,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:57:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546725421] [2025-01-10 06:57:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546725421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:57:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788499705] [2025-01-10 06:57:07,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:57:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:07,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:57:07,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:57:07,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2025-01-10 06:57:07,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 216 transitions, 2066 flow. Second operand has 9 states, 9 states have (on average 37.111111111111114) internal successors, (334), 9 states have internal predecessors, (334), 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-10 06:57:07,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:07,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2025-01-10 06:57:07,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:14,883 INFO L124 PetriNetUnfolderBase]: 31580/54645 cut-off events. [2025-01-10 06:57:14,884 INFO L125 PetriNetUnfolderBase]: For 222892/227124 co-relation queries the response was YES. [2025-01-10 06:57:15,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201958 conditions, 54645 events. 31580/54645 cut-off events. For 222892/227124 co-relation queries the response was YES. Maximal size of possible extension queue 1555. Compared 480685 event pairs, 24227 based on Foata normal form. 1599/53372 useless extension candidates. Maximal degree in co-relation 201572. Up to 29548 conditions per place. [2025-01-10 06:57:15,564 INFO L140 encePairwiseOnDemand]: 87/105 looper letters, 209 selfloop transitions, 48 changer transitions 7/290 dead transitions. [2025-01-10 06:57:15,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 290 transitions, 3155 flow [2025-01-10 06:57:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:57:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:57:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 579 transitions. [2025-01-10 06:57:15,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39387755102040817 [2025-01-10 06:57:15,566 INFO L175 Difference]: Start difference. First operand has 240 places, 216 transitions, 2066 flow. Second operand 14 states and 579 transitions. [2025-01-10 06:57:15,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 290 transitions, 3155 flow [2025-01-10 06:57:16,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 290 transitions, 3066 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:57:16,046 INFO L231 Difference]: Finished difference. Result has 251 places, 223 transitions, 2179 flow [2025-01-10 06:57:16,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1977, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2179, PETRI_PLACES=251, PETRI_TRANSITIONS=223} [2025-01-10 06:57:16,047 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 151 predicate places. [2025-01-10 06:57:16,047 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 223 transitions, 2179 flow [2025-01-10 06:57:16,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.111111111111114) internal successors, (334), 9 states have internal predecessors, (334), 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-10 06:57:16,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:16,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:16,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 06:57:16,048 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:57:16,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1778735915, now seen corresponding path program 1 times [2025-01-10 06:57:16,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:16,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627801900] [2025-01-10 06:57:16,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:16,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:16,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:57:16,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:57:16,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:16,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:57:16,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:16,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627801900] [2025-01-10 06:57:16,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627801900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:16,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:16,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:16,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744107755] [2025-01-10 06:57:16,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:16,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:16,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:16,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:16,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:16,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:57:16,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 223 transitions, 2179 flow. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 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-10 06:57:16,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:16,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:57:16,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand